{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T07:07:56Z","timestamp":1780470476815,"version":"3.54.1"},"reference-count":47,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T00:00:00Z","timestamp":1780012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Can artificial intelligence discover, from raw experience and without human supervision, concepts that humans have discovered? One challenge is that human concepts themselves are fluid: conceptual boundaries can shift, split, and merge as inquiry progresses (e.g., Pluto is no longer considered a planet). To make progress, we need a definition of \u201cconcept\u201d that is not merely a dictionary label, but a structure that can be revised, compared, and aligned across agents. We propose an algorithmic information viewpoint that treats a concept as an information object defined only through its structural relation to an agent\u2019s total experience. The core constraint is determination: a set of parts forms a reversible consistency relation if any missing part is recoverable from the others (up to the standard logarithmic slack in Kolmogorov complexity). This reversibility prevents \u201cconcepts\u201d from floating free of experience and turns concept existence into a checkable structural claim. To judge whether a decomposition is natural, we define excess information, measuring the redundancy overhead introduced by splitting experience into multiple separately described parts. On top of these definitions, we formulate dialectics as an optimization dynamics: as new patches of information appear (or become contested), competing concepts bid to explain them via shorter conditional descriptions, driving systematic expansion, contraction, splitting, and merging. Finally, we formalize low-cost concept transmission and multi-agent alignment using small grounds that allow another agent to reconstruct the same concept under a shared protocol, making communication a concrete compute-bits trade-off.<\/jats:p>","DOI":"10.3390\/e28060611","type":"journal-article","created":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T06:17:31Z","timestamp":1780467451000},"page":"611","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dialectics for Artificial Intelligence"],"prefix":"10.3390","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0316-146X","authenticated-orcid":false,"given":"Zhengmian","family":"Hu","sequence":"first","affiliation":[{"name":"Adobe Research, Adobe Inc., 345 Park Avenue, San Jose, CA 95110-2704, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2026,5,29]]},"reference":[{"key":"ref_1","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Probl. Inf. Transm."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A formal theory of inductive inference. Part I","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inf. Control"},{"key":"ref_3","first-page":"206","article-title":"Laws of information conservation (non-growth) and aspects of the foundation of probability theory","volume":"10","author":"Levin","year":"1974","journal-title":"Probl. Inf. Transm."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Li, M., and Vit\u00e1nyi, P.M.B. (2019). An Introduction to Kolmogorov Complexity and Its Applications, Springer. [4th ed.].","DOI":"10.1007\/978-3-030-11298-1"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","article-title":"Modeling by shortest data description","volume":"14","author":"Rissanen","year":"1978","journal-title":"Automatica"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnwald, P.D. (2007). The Minimum Description Length Principle, MIT Press.","DOI":"10.7551\/mitpress\/4643.001.0001"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0304-3975(01)00033-0","article-title":"Conditional complexity and codes","volume":"271","author":"Muchnik","year":"2002","journal-title":"Theor. Comput. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2451","DOI":"10.1109\/TIT.2011.2110130","article-title":"Information distance in multiples","volume":"57","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"278","DOI":"10.2307\/2981683","article-title":"Present position and potential developments: Some personal views: Statistical theory: The prequential approach","volume":"147","author":"Dawid","year":"1984","journal-title":"J. R. Stat. Soc. Ser. A (Gen.)"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1109\/18.681318","article-title":"Information distance","volume":"44","author":"Bennett","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","article-title":"Clustering by compression","volume":"51","author":"Cilibrasi","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume":"Volume 1","author":"Neyman","year":"1967","journal-title":"Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least squares quantization in PCM","volume":"28","author":"Lloyd","year":"1982","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"39","author":"Dempster","year":"1977","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1109\/34.537343","article-title":"Region Competition: Unifying Snakes, Region Growing, and Bayes\/MDL for Multiband Image Segmentation","volume":"18","author":"Zhu","year":"1996","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Rao, S.R., Mobahi, H., Yang, A.Y., Sastry, S.S., and Ma, Y. (2009). Natural Image Segmentation with Adaptive Texture and Boundary Encoding. Proceedings of the Asian Conference on Computer Vision (ACCV), Springer.","DOI":"10.1007\/978-3-642-12307-8_13"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"379\u2013423, 623\u2013656","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Syst. Tech. J."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Cover, T.M., and Thomas, J.A. (2006). Elements of Information Theory, Wiley. [2nd ed.].","DOI":"10.1002\/047174882X"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1093\/comjnl\/11.2.185","article-title":"An information measure for classification","volume":"11","author":"Wallace","year":"1968","journal-title":"Comput. J."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1546","DOI":"10.1109\/TPAMI.2007.1085","article-title":"Segmentation of multivariate mixed data via lossy data coding and compression","volume":"29","author":"Ma","year":"2007","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"McLachlan, G., and Peel, D. (2000). Finite Mixture Models, Wiley.","DOI":"10.1002\/0471721182"},{"key":"ref_22","first-page":"993","article-title":"Latent Dirichlet Allocation","volume":"3","author":"Blei","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"ref_23","unstructured":"Greff, K., Srivastava, R.K., and Schmidhuber, J. (2015). Binding via Reconstruction Clustering. arXiv."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Yang, Y., Loquercio, A., Scaramuzza, D., and Soatto, S. (2019). Unsupervised Moving Object Detection via Contextual Information Separation. Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Long Beach, CA, USA, 15\u201320 June 2019, IEEE.","DOI":"10.1109\/CVPR.2019.00097"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Savarese, P., Kim, S.S.Y., Maire, M., Shakhnarovich, G., and McAllester, D. (2021). Information-Theoretic Segmentation by Inpainting Error Maximization. Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Virtual, 19\u201325 June 2021, IEEE.","DOI":"10.1109\/CVPR46437.2021.00402"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1162\/neco.1992.4.6.863","article-title":"Learning Factorial Codes by Predictability Minimization","volume":"4","author":"Schmidhuber","year":"1992","journal-title":"Neural Comput."},{"key":"ref_27","unstructured":"Locatello, F., Bauer, S., Lucic, M., R\u00e4tsch, G., Gelly, S., Sch\u00f6lkopf, B., and Bachem, O. (2019, January 9\u201315). Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representations. Proceedings of the 36th International Conference on Machine Learning (ICML), Long Beach, CA, USA."},{"key":"ref_28","unstructured":"Goodfellow, I.J., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., and Bengio, Y. (2014, January 8\u201313). Generative Adversarial Nets. Proceedings of the Advances in Neural Information Processing Systems, Montreal, QC, Canada."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Adipoetra, M., and Martin, S. (2025). Deep Generative Clustering with VAEs and Expectation-Maximization. arXiv.","DOI":"10.1007\/978-3-031-92366-1_28"},{"key":"ref_30","unstructured":"Abdali, S., Goksen, C., Amizadeh, S., and Koishida, K. (2025). Self-Reflecting Large Language Models: A Hegelian Dialectical Approach. arXiv."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Anghel, C., Anghel, A.A., Pecheanu, E., Susnea, I., Cocu, A., and Istrate, A. (2025). Multi-Model Dialectical Evaluation of LLM Reasoning Chains: A Structured Framework with Dual Scoring Agents. Informatics, 12.","DOI":"10.3390\/informatics12030076"},{"key":"ref_32","first-page":"83","article-title":"The Kindest Cut: Minimum Message Length Segmentation","volume":"Volume 1160","author":"Baxter","year":"1996","journal-title":"Proceedings of the Algorithmic Learning Theory: 7th International Workshop, ALT \u201996, Sydney, Australia, 23\u201325 October 1996"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/3-540-64383-4_19","article-title":"Minimum Message Length Segmentation","volume":"Volume 1394","author":"Wu","year":"1998","journal-title":"Proceedings of the Research and Development in Knowledge Discovery and Data Mining: Second Pacific-Asia Conference, PAKDD \u201998, Melbourne, Australia, 15\u201317 April 1998"},{"key":"ref_34","unstructured":"Ding, Y., Rousseau, R., and Wolfram, D. (2014). Community Detection and Visualization of Networks with the Map Equation Framework. Measuring Scholarly Impact: Theory and Practice, Springer International Publishing."},{"key":"ref_35","unstructured":"Bommasani, R., Hudson, D.A., Adeli, E., Altman, R., Arora, S., von Arx, S., Bernstein, M.S., Bohg, J., Bosselut, A., and Brunskill, E. (2021). On the Opportunities and Risks of Foundation Models. arXiv."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., and Lo, W.Y. (2023). Segment Anything. Proceedings of the IEEE\/CVF International Conference on Computer Vision (ICCV), Paris, France, 1\u20136 October 2023, IEEE.","DOI":"10.1109\/ICCV51070.2023.00371"},{"key":"ref_37","unstructured":"Zhang, C., Han, D., Qiao, Y., Kim, J.U., Bae, S.H., Lee, S., and Hong, C.S. (2023). Faster Segment Anything: Towards Lightweight SAM for Mobile Applications. arXiv."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Ke, L., Ye, M., Danelljan, M., Liu, Y., Tai, Y.W., Tang, C.K., and Yu, F. Segment Anything in High Quality. Proceedings of the Advances in Neural Information Processing Systems 36 (NeurIPS 2023), New Orleans, LA, USA, 10\u201316 December 2023, Curran Associates, Inc.","DOI":"10.52202\/075280-1303"},{"key":"ref_39","unstructured":"Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., and Chen, W. (2022, January 25\u201329). LoRA: Low-Rank Adaptation of Large Language Models. Proceedings of the International Conference on Learning Representations (ICLR), Virtual."},{"key":"ref_40","first-page":"149","article-title":"Common Information Is Far Less Than Mutual Information","volume":"2","year":"1973","journal-title":"Probl. Control Inf. Theory"},{"key":"ref_41","first-page":"1","article-title":"Pairs of Words with Nonmaterializable Mutual Information","volume":"36","author":"Romashchenko","year":"2000","journal-title":"Probl. Inf. Transm."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Caillat-Grenier, G., Romashchenko, A., and Zyavgarov, R. (2024). Common information in well-mixing graphs and applications to information-theoretic cryptography. Proceedings of the 2024 IEEE Information Theory Workshop (ITW), Shenzhen, China, 24\u201328 November 2024, IEEE.","DOI":"10.1109\/ITW61385.2024.10806994"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1038\/s41586-023-06735-9","article-title":"Scaling Deep Learning for Materials Discovery","volume":"624","author":"Merchant","year":"2023","journal-title":"Nature"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"2504378","DOI":"10.1002\/adma.202504378","article-title":"Artificial Intelligence-Driven Approaches in Semiconductor Research","volume":"37","author":"Zheng","year":"2025","journal-title":"Adv. Mater."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1038\/s41592-020-00979-3","article-title":"MARS: Discovering Novel Cell Types across Heterogeneous Single-Cell Experiments","volume":"17","author":"Zitnik","year":"2020","journal-title":"Nat. Methods"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Iwaniec, H., and Kowalski, E. (2004). Analytic Number Theory, American Mathematical Society Colloquium Publications.","DOI":"10.1090\/coll\/053"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","article-title":"Expander graphs and their applications","volume":"43","author":"Hoory","year":"2006","journal-title":"Bull. Am. Math. Soc."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/6\/611\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T06:21:19Z","timestamp":1780467679000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/6\/611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,29]]},"references-count":47,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2026,6]]}},"alternative-id":["e28060611"],"URL":"https:\/\/doi.org\/10.3390\/e28060611","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,29]]}}}