<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>asymmetric learning &#8211; Science</title>
	<atom:link href="https://scienmag.com/tag/asymmetric-learning/feed/" rel="self" type="application/rss+xml" />
	<link>https://scienmag.com</link>
	<description></description>
	<lastBuildDate>Thu, 08 Oct 2026 23:21:18 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.1.3</generator>

<image>
	<url>https://scienmag.com/wp-content/uploads/2024/07/cropped-scienmag_ico-32x32.jpg</url>
	<title>asymmetric learning &#8211; Science</title>
	<link>https://scienmag.com</link>
	<width>32</width>
	<height>32</height>
</image> 
<site xmlns="com-wordpress:feed-additions:1">73899611</site>	<item>
		<title>New Deep Hashing Framework Speeds Up Multi-Label Image Search</title>
		<link>https://scienmag.com/new-deep-hashing-framework-speeds-up-multi-label-image-search/</link>
		
		<dc:creator><![CDATA[Blake Davidson]]></dc:creator>
		<pubDate>Thu, 08 Oct 2026 23:21:18 +0000</pubDate>
				<category><![CDATA[Technology and Engineering]]></category>
		<category><![CDATA[asymmetric learning]]></category>
		<category><![CDATA[binary codes]]></category>
		<category><![CDATA[binary hash code comparison]]></category>
		<category><![CDATA[binary image coding]]></category>
		<category><![CDATA[computer vision]]></category>
		<category><![CDATA[deep hashing]]></category>
		<category><![CDATA[deep hashing for image retrieval]]></category>
		<category><![CDATA[deep supervised hashing methods]]></category>
		<category><![CDATA[efficient image database search]]></category>
		<category><![CDATA[Hamming space]]></category>
		<category><![CDATA[image retrieval]]></category>
		<category><![CDATA[Machine learning]]></category>
		<category><![CDATA[MS-COCO]]></category>
		<category><![CDATA[multi-label image benchmarks]]></category>
		<category><![CDATA[multi-label image search]]></category>
		<category><![CDATA[multi-label image similarity preservation]]></category>
		<category><![CDATA[multi-label learning]]></category>
		<category><![CDATA[NUS-WIDE]]></category>
		<category><![CDATA[ResNet34]]></category>
		<category><![CDATA[scalable image retrieval systems]]></category>
		<category><![CDATA[semantic supervision]]></category>
		<category><![CDATA[TCADH framework]]></category>
		<category><![CDATA[triple collaborative asymmetric deep hashing]]></category>
		<category><![CDATA[ultra-compact image representation]]></category>
		<guid isPermaLink="false">https://scienmag.com/?p=250413</guid>

					<description><![CDATA[Researchers have unveiled a triple-stream deep hashing framework that compresses multi-label images into compact binary codes with higher accuracy and lower computational cost than existing methods.]]></description>
										<content:encoded><![CDATA[<p>Image search on the modern web faces a deceptively simple problem: how do you find, in milliseconds, every picture in a database of billions that matches what a user is looking for? A new study published in Complex &amp; Intelligent Systems offers a fresh answer. Researchers Weigang Wang of Changchun University and Ziyuan Cui of Ocean University of China have developed a framework called Triple Collaborative Asymmetric Deep Hashing, or TCADH, which compresses images into ultra-compact binary codes while preserving the rich, often overlapping meanings that real photographs carry. The work, published as an open-access article with a permanent DOI, reports consistent performance gains over leading deep supervised hashing methods across four widely used multi-label image benchmarks.</p>
<p>The core idea behind hashing-based image retrieval is to translate each image into a short string of binary digits, its hash code, so that similar images end up with similar codes. Once images are represented this way, comparing a query against a massive database reduces to counting differing bits, an operation that modern processors execute at extraordinary speed and that requires only a few dozen bits of storage per image instead of thousands of floating-point numbers. For single-label images, where each picture has one clear category, this translation is relatively straightforward. But most real-world photographs are messier: a single street scene might simultaneously depict a person, a car, a dog, a building, and an overcast sky. Multi-label retrieval demands that a compact code capture all of these meanings at once, a far harder compression problem.</p>
<p>The authors identify two persistent weaknesses in existing approaches. First, most supervised hashing methods rely on a semantic similarity matrix that simply declares whether two images are similar or dissimilar, based on how many labels they share. That binary or pairwise judgment, the researchers argue, throws away the richer guidance that semantic information could provide throughout the learning process. The semantic signal is reduced to a static target rather than an active participant in shaping how image features flow through the network. Second, conventional architectures are symmetric: they push both the incoming query images and the entire database of stored images through the same full deep network every time codes must be generated. Because the database side vastly outnumbers the query side, this symmetry wastes enormous computational effort and inflates the time cost of training and updating the retrieval index.</p>
<p>TCADH tackles both problems with a three-stream design. Two asymmetric image streams process, respectively, the original images and augmented versions of those same images, while a third stream carries the semantic label information itself. All three streams are mapped into a common discrete Hamming space, the mathematical arena where binary hash codes live and where distance is measured by counting bit differences. The word collaborative in the method&#8217;s name refers to this alignment: instead of letting labels sit passively in a similarity matrix, the framework actively pulls original images, their augmented counterparts, and their semantic labels into mutual agreement within the same binary space. The result is a code that reflects not just what an image looks like but what it means, from multiple complementary perspectives simultaneously.</p>
<p>The image-processing backbone of the framework is built on ResNet34, a widely used convolutional neural network architecture known for its balance of depth and efficiency. The authors construct a Siamese network from this backbone, meaning that two structurally identical copies of the network process the original and augmented images in parallel with shared parameters. A key innovation sits inside this backbone: a sign-consistency-guided feature enhancement block. Deep hashing requires converting continuous, real-valued features into binary codes, typically by taking the sign of each feature dimension, and this dimensionality reduction inevitably discards information. The enhancement block uses the sign of the features as a guide to reinforce the information that survives the compression step, mitigating the loss that would otherwise degrade the quality of the final hash codes.</p>
<p>Supervision in TCADH comes from a weighted pairwise loss applied across the three streams. The loss function is designed to maximize semantic consistency among different data streams that originate from the same image source. In practice, this means the hash code of an original image, the code of its augmented twin, and the representation derived from its semantic labels are all pushed toward agreement, with weights that let the model calibrate how strongly each pair of streams should align. Because the label stream provides fine-grained semantic supervision rather than a coarse similar-or-not verdict, the network receives a much denser training signal. Every label attached to an image contributes to shaping the code, which matters enormously in multi-label settings where a single image may carry half a dozen or more categories.</p>
<p>The asymmetric learning strategy is the framework&#8217;s answer to the computational bottleneck of symmetric hashing. Rather than forcing both queries and database images through identical encoding pipelines, TCADH learns to capture similarities directly between the discrete hash codes and the real-valued image features. This decoupling means the expensive deep feature extraction can be handled differently on each side of the retrieval task, improving retrieval precision while simultaneously accelerating the model&#8217;s convergence during training. The practical implication is significant for anyone operating large-scale image services: the database side of the system, which may contain millions or billions of entries, no longer pays the full price of symmetric deep encoding every time the index is refreshed.</p>
<p>The empirical evaluation spans four of the most demanding multi-label benchmarks in computer vision research: NUS-WIDE, MIRFLICKR-25K, MS-COCO, and VOC2012. These datasets collectively contain hundreds of thousands of images annotated with dozens of possible labels, from everyday objects to abstract scene attributes, and they have long served as the proving grounds for retrieval algorithms. Across all four, the authors report that TCADH outperformed state-of-the-art deep supervised hashing methods on multi-label retrieval tasks. While the abstract does not enumerate specific numerical margins, the consistency of the advantage across datasets with very different characteristics, from the social-media imagery of Flickr to the densely annotated everyday scenes of MS-COCO, suggests that the framework&#8217;s benefits are robust rather than tailored to one particular data distribution.</p>
<p>The significance of this work extends beyond a leaderboard improvement. As visual data continues to grow at a staggering pace, driven by smartphones, surveillance networks, e-commerce catalogs, and scientific imaging, the energy and latency costs of exhaustive similarity search become prohibitive. Hashing remains one of the few techniques that scales gracefully to web-scale corpora, and improvements in how faithfully binary codes preserve multi-label semantics translate directly into better user experiences and lower infrastructure costs. The asymmetric design philosophy championed by TCADH, in which the query side and the database side are treated as fundamentally different computational problems, is likely to influence how future retrieval systems are architected, particularly as researchers explore combinations of hashing with large vision-language models that could supply even richer semantic streams.</p>
<p>The study, received in April 2026 and accepted that September, arrives at a moment when the field of deep hashing is maturing from proof-of-concept demonstrations into engineering-grade systems. By weaving semantic supervision directly into the multimodal information flow, compressing images with sign-guided feature enhancement, and breaking the symmetry that has long constrained training efficiency, Wang and Cui have outlined a template for retrieval systems that are simultaneously more accurate and more economical. The article is available open access under a Creative Commons Attribution 4.0 license, allowing researchers and practitioners anywhere to examine the method in full technical detail and to build upon its three-stream, collaboratively aligned vision of what image search can become.</p>
<p><strong>Subject of Research:</strong> Deep hashing for multi-label image retrieval</p>
<p><strong>Article Title:</strong> Triple collaborative asymmetric deep hashing for multi-label image retrieval</p>
<p><strong>Article References:</strong> Wang, W., &amp; Cui, Z. (2026). Triple collaborative asymmetric deep hashing for multi-label image retrieval. <em>Complex &amp;amp; Intelligent Systems</em>. <a href="https://doi.org/10.1007/s40747-026-02533-8" rel="noopener noreferrer">https://doi.org/10.1007/s40747-026-02533-8</a></p>
<p><strong>Image Credits:</strong> AI Generated</p>
<p><strong>DOI:</strong> <a href="https://doi.org/10.1007/s40747-026-02533-8" rel="noopener noreferrer">10.1007/s40747-026-02533-8</a></p>
<p><strong>Keywords:</strong> image retrieval, deep hashing, multi-label learning, computer vision, asymmetric learning, Hamming space, ResNet34, semantic supervision, NUS-WIDE, MS-COCO, binary codes, machine learning</p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">250413</post-id>	</item>
		<item>
		<title>Asymmetric Learning Drives Flexible Transitive Inference Adaptation</title>
		<link>https://scienmag.com/asymmetric-learning-drives-flexible-transitive-inference-adaptation/</link>
		
		<dc:creator><![CDATA[Gavin Prescott]]></dc:creator>
		<pubDate>Sat, 15 Nov 2025 05:26:48 +0000</pubDate>
				<category><![CDATA[Psychology & Psychiatry]]></category>
		<category><![CDATA[asymmetric learning]]></category>
		<category><![CDATA[cognitive flexibility]]></category>
		<category><![CDATA[cognitive mechanisms of inference]]></category>
		<category><![CDATA[decision-making in dynamic environments]]></category>
		<category><![CDATA[experimental paradigms in psychology]]></category>
		<category><![CDATA[higher-order reasoning in humans]]></category>
		<category><![CDATA[innovative applications in artificial intelligence]]></category>
		<category><![CDATA[learning pathways and strategies]]></category>
		<category><![CDATA[neuropsychology and inference]]></category>
		<category><![CDATA[relational information prioritization]]></category>
		<category><![CDATA[relational structure in learning]]></category>
		<category><![CDATA[transitive inference adaptation]]></category>
		<guid isPermaLink="false">https://scienmag.com/asymmetric-learning-drives-flexible-transitive-inference-adaptation/</guid>

					<description><![CDATA[In a groundbreaking new study that reshapes our understanding of cognitive flexibility and learning, researchers have unveiled the nuanced mechanisms underpinning adaptive inference in dynamic environments. The study, authored by T.A. Graham and B. Spitzer, delves deeply into the concept of asymmetric learning—a phenomenon where the brain prioritizes certain relational information over others to optimize [&#8230;]]]></description>
										<content:encoded><![CDATA[<p>In a groundbreaking new study that reshapes our understanding of cognitive flexibility and learning, researchers have unveiled the nuanced mechanisms underpinning adaptive inference in dynamic environments. The study, authored by T.A. Graham and B. Spitzer, delves deeply into the concept of asymmetric learning—a phenomenon where the brain prioritizes certain relational information over others to optimize decision-making in changing contexts. Published in <em>Communications Psychology</em>, the findings promise to revolutionize traditional models of transitive inference and open pathways for innovative applications in artificial intelligence and neuropsychology.</p>
<p>Transitive inference, the cognitive ability to deduce a relationship between two items based on their relation to a third item, has long been considered a hallmark of higher-order reasoning in both humans and animals. However, prior models often assumed symmetric learning processes, wherein the strength of learned associations adjusted uniformly across different relational directions. Graham and Spitzer challenge this assumption, presenting compelling evidence that learning is inherently asymmetric and tailored to environmental contingencies.</p>
<p>Central to their investigation is the concept of relational structure—how items or concepts are arranged in hierarchical or networked frameworks that dictate learning pathways. The researchers designed sophisticated experimental paradigms to manipulate relational structures dynamically, allowing them to observe how subjects adjust their inference strategies when these underlying structures change unpredictably. This approach brings to light the brain&#8217;s remarkable adaptability and the selective updating of specific relational links over others.</p>
<p>The findings reveal that asymmetric learning is not a flaw or limitation but a highly adaptive strategy. When confronted with altered relational structures, the cognitive system preferentially enhances or suppresses specific directional associations to maintain coherent inference chains. This selective plasticity ensures that learned information remains relevant and minimizes interference from outdated knowledge, thereby optimizing behavioral responses.</p>
<p>Underpinning this discovery is a sophisticated computational model that integrates asymmetric learning rates across relational dimensions. The model quantitatively captures how individuals weigh evidence differently depending on whether it supports upward or downward inference along a hierarchy. It further accounts for the variable impact of new information on strengthening or weakening existing associations, reflecting a dynamic balance between stability and flexibility in knowledge representations.</p>
<p>To empirically validate their theoretical framework, the authors employed a combination of behavioral testing and rigorous statistical analyses. Participants engaged in tasks requiring transitive inference across shifting relational networks, with performance metrics illustrating rapid adjustments aligned with model predictions. Notably, the degree of asymmetry in learning correlated with enhanced adaptability, suggesting potential avenues for targeted cognitive training or rehabilitation.</p>
<p>Beyond cognitive psychology, the implications of this research ripple through multiple scientific domains. In artificial intelligence, algorithms inspired by asymmetric learning principles could bolster machine learning systems’ capacity to adapt fluidly to evolving data environments. By mimicking human-like inference adaptability, AI agents might better handle tasks involving hierarchical categorization or relational reasoning under uncertainty.</p>
<p>Neuroscientifically, the study invites a reevaluation of neural circuit models supporting learning and plasticity. Preliminary neuroimaging evidence points to differential activation patterns in brain regions implicated in relational processing, such as the prefrontal cortex and hippocampus, when learning asymmetrically. Understanding these neural substrates could illuminate pathways to treating cognitive disorders where inference and adaptability are impaired.</p>
<p>The research also challenges long-standing theoretical paradigms, prompting debates on the nature of logical reasoning and associative learning. Asymmetric learning posits a more nuanced mechanism, where the cognitive system does not merely statically encode relationships but actively prioritizes certain inference trajectories over others based on context. This insight demands a reconsideration of educational strategies to nurture flexible reasoning skills adaptable to complex, real-world scenarios.</p>
<p>Importantly, the study’s innovative methodology—combining theoretical modeling, experimental manipulation, and real-time behavioral observation—sets a new standard for research exploring cognitive adaptability. Such integrative approaches enable researchers to dissect complex mental operations with precision, capturing the dynamic interplay between learning mechanisms and environmental demands.</p>
<p>Graham and Spitzer’s work also raises intriguing questions about individual differences in asymmetric learning capacities. Variability in learners’ adaptability could reflect underlying genetic, developmental, or experiential factors, offering rich territory for future research into personalized cognitive enhancement and neuroplasticity.</p>
<p>Moreover, the concept of asymmetric learning may extend beyond transitive inference into broader realms of decision-making and social cognition. Humans often navigate environments laden with hierarchical and relational complexities, from social hierarchies to conceptual taxonomies, suggesting that asymmetric processing may be a ubiquitous cognitive strategy.</p>
<p>The paper concludes with a call for interdisciplinary collaboration to expand the applicability of asymmetric learning frameworks, proposing cross-talk between psychology, neuroscience, artificial intelligence, and education science. Such synergy promises not only to deepen fundamental knowledge but also to translate findings into practical innovations for technology and health.</p>
<p>As society increasingly depends on adaptive systems—whether human cognition or artificial agents—the importance of understanding how learning asymmetries facilitate flexibility cannot be overstated. This seminal study offers a transformative lens through which to view learning and inference, reshaping the future landscape of cognitive science and beyond.</p>
<p>The results herald a new era where the brain&#8217;s selective treatment of relational structures is recognized as a core feature of intelligent behavior. By embracing asymmetry, researchers and practitioners alike can harness the power of adaptability, improving how we learn, reason, and interact with ever-changing worlds.</p>
<hr />
<p><strong>Subject of Research:</strong> Cognitive adaptability and asymmetric learning during transitive inference in changing relational environments.</p>
<p><strong>Article Title:</strong> Asymmetric learning and adaptability to changes in relational structure during transitive inference.</p>
<p><strong>Article References:</strong><br />
Graham, T.A., Spitzer, B. Asymmetric learning and adaptability to changes in relational structure during transitive inference. <em>Commun Psychol</em> <strong>3</strong>, 155 (2025). <a href="https://doi.org/10.1038/s44271-025-00352-0">https://doi.org/10.1038/s44271-025-00352-0</a></p>
<p><strong>Image Credits:</strong> AI Generated</p>
<p><strong>DOI:</strong> <a href="https://doi.org/10.1038/s44271-025-00352-0">https://doi.org/10.1038/s44271-025-00352-0</a></p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">106146</post-id>	</item>
	</channel>
</rss>
