Publications

Reasoning with Preference Constraints: A Benchmark for Language Models in Many-to-One Matching Markets
Recursive Vision Language Models for General Symbolic Reasoning
Omid Nejati Manzari
Hard symbolic-reasoning tasks such as Sudoku, maze pathfinding, and ARC remain challenging for LLMs due to their fixed-depth autoregressive … (see more)reasoning, which limits systematic search, refinement, and backtracking. While recursive models such as Hierarchical Reasoning Model (HRM) and Tiny Recursive Model (TRM) address this limitation through iterative latent-state refinement, they are typically task-specific and do not leverage pretrained language priors. We propose R-Qwen, a recursive reasoning framework built upon a pretrained Qwen backbone. R-Qwen repeatedly refines a candidate solution through programmatic self-recursion and deep supervision, combining the structured iterative computation of recursive models with the linguistic and reasoning priors of pretrained LLMs. We further adapt Hierarchical Supervision Weighting (HSW) to autoregressive models by exponentially weighting losses across recursive steps. HSW reduces gradient variance by at least 50\%, improves the signal-to-noise ratio of stochastic gradients, and accelerates convergence. Across eight challenging benchmarks, R-Qwen consistently outperforms prior recursive reasoning models and substantially larger LLMs while using a comparable number of trainable parameters. Notably, on ARC-AGI dataset, our model achieves a 27.6\% improvement over the baseline, highlighting the effectiveness of recursive refinement for general symbolic reasoning. These results suggest that recursive reasoning mechanisms and pretrained language model priors are complementary approaches for improving symbolic puzzle-solving. Code and models will be released after acceptance.
Inferring brain-wide interactions using data-constrained recurrent neural network models
Matthew G. Perich
Charlotte Arlt
Sofia Soares
Siyan Zhou
Manuel Beiran
Aaron S. Andalman
Tyler Benster
Megan E. Young
Clayton P. Mosher
Juri Minxha
Eugene Carter
Ueli Rutishauser
Peter H. Rudebeck
Christopher D. Harvey
Karl Deisseroth
Kanaka Rajan
Nonlinear Laplacians Improve Signed-Directed Graph Learning
Yuichi Yoshida
While signed-directed graphs have been studied using linear Laplacians in the design of graph neural networks, relatively little research ha… (see more)s focused on developing non-linear Laplacian operators for such networks. We introduce a non-linear Laplacian operator specific to signed and directed networks (NLSD). This non-linear operator extends the concepts of the signed Laplacian for signed graphs and the Laplacian for directed graphs. The NLSD calculates node-specific potentials based on features More precisely, if the potential discrepancy is not aligned with the edge direction, we ignore it (and vice versa) leveraging message-passing techniques only across edges where potential discrepancies align with the edge's direction. Utilizing this novel operator, we propose an efficient spectral GNN framework (NLSD-GNN). We conducted comprehensive evaluations focusing on node classification and link prediction, examining scenarios involving signed, directional, or both types of information. Our findings reveal that this spectral GNN framework not only integrates signed and directional data effectively but also achieves superior performance across diverse datasets.
De novo L-(+)-tartaric acid biosynthesis in multi-modular engineered yeasts
Xuan Zhou
Jiaheng Hou
Zikai Wang
Zhendong Li
Yang Li
Xitong Li
Xianhao Xu
Yanfeng Liu
Jianghua Li
Guocheng Du
Dacheng Ma
J. Tang
Jian Chen
Xueqin Lv
Long Liu
L-(+)-tartaric acid (L-TA) is a high-value chiral organic acid essential for food and pharmaceuticals. Despite its industrial importance, su… (see more)stainable green production is constrained by the lack of a fully defined biosynthetic pathway. Here, we report the de novo biosynthesis of L-TA in Saccharomyces cerevisiae through reaction-guided enzyme mining, experimental validation, and Enzyme Commission-specific Catalytic Hybrid Optimizer (ECHO)-assisted enzyme prioritization. We first elucidate the elusive two-step conversion from precursor 5-keto-D-gluconic acid (5-KGA) to L-TA, catalyzed by transketolase (TK) and succinate semialdehyde dehydrogenase (SSDH). To optimize this critical step, we develop the ECHO. This multimodal framework integrates sequence, substrate, and pocket-aware structural information to identify high-performance TK-SSDH pairs. By integrating this pathway with de novo precursor synthesis, cofactor engineering, and semi-rational protein engineering, a final L-TA titer of 6.59 mg L−1 was achieved in a 5-L bioreactor. By connecting computational mining and metabolic assembly through a multi-module engineering strategy, our study establishes a green platform for L-TA production and demonstrates an effective workflow for synthetic pathway design. L-(+)-tartaric acid (L-TA) is a high-value chiral organic acid for food and pharmaceuticals. Here the authors produce L-TA in S. cerevisiae through reaction-guided enzyme mining and Enzyme Commission-specific Catalytic Hybrid Optimizer (ECHO)-assisted enzyme prioritization.
Preparation of MgAl2O4-reinforced magnesium composite refractories from high silicon magnesite tailings: α-Al2O3 /AlN reaction mechanism and thermal shock resistance
Sheng Wu
Qingdong Hou
Xudong Luo
Cairan Wang
Jinfan Xu
Recent progress of large-scale biomarker consortia and paths forward in biomarker development for autism
Jason W. Griffin
Brianna Cairney
William E. Carson, IV
Lacey Chetcuti
Adrien E.E. Dubois
Sébastien Jacquemont
Shafali Jeste
Jacob P. Momsen
Adam J. Naples
James C. McPartland
In situ synthesis and bioactivity mechanism of Ca/P-containing micro-arc oxidation coatings on SLM porous TC4 titanium alloy surfaces
Kexin Di
Zhen Ma
Yudong Yan
Tai Peng
Chuanhua Yang
M Q Li
The Overstated Cost of AI Fairness in Criminal Justice
Warut Khern-am-nuai
A dominant critique of algorithmic fairness holds that increasing fairness reduces predictive accuracy, imposing a cost on society. We chall… (see more)enge that assumption by empirically analyzing the COMPAS dataset. We make two contributions. First, using causal inference methods, we show that racial bias is not only present in the COMPAS dataset but is also amplified by the models trained on it. Widely used models do more than replicate existing bias; they exacerbate it. This undercuts both the assumption that algorithmic decision-making offers a neutral improvement over human judgment and the weaker claim that it merely mirrors preexisting human bias. Second, we reframe the fairness-accuracy tradeoff. Applying fairness constraints does not necessarily cost predictive accuracy in criminal justice. Prediction systems operationalize concepts such as risk through implicit and often flawed normative choices about what to predict and how. The tradeoff claim assumes that the unconstrained model's prediction is an optimal baseline. Fairness constraints can instead correct distortions introduced by biased outcome variables: rearrest data, in this case, captures and magnifies systemic racial disparities. Under some interventions, therefore, fairness carries none of the cost presumed in policy debates. These dynamics extend beyond criminal justice to lending, hiring, and housing, where biased outcome variables reinforce inequality independently of proxy selection. We draw out what this implies for how law and policy should approach fairness adjustments in criminal law.
Hierarchical Clustering of Networks via Hierarchical Distance Matrices
Li Chen
Nathaniel Josephs
Eric D. Kolaczyk
Lizhen Lin
Clustering populations of networks while recovering their latent hierarchical organization is a fundamental yet largely unexplored problem i… (see more)n network analysis. To formalize this, we introduce the Hierarchical Distance Matrix, a specific class of population-level distance matrices that encodes latent hierarchical organization through recursively nested distance separation, accommodating unbalanced tree depths. Building on this framework, we propose a fully data-driven top-down procedure: network hierarchical clustering based on two-sample testing (NHC-TST). The algorithm recursively splits networks via spectral clustering and uses a graph-based two-sample stopping rule. The procedure adaptively determines the branching structure without requiring prior knowledge of the number of clusters or tree depth. Theoretically, we establish exact recovery of the population-level hierarchical structure and statistical consistency in the empirical procedure. Simulation studies demonstrate highly accurate recovery of both cluster memberships and hierarchical relationships across a wide range of settings. Applied to a global migration dataset, NHC-TST uncovers interpretable multi-resolution temporal structures that are not revealed by conventional flat clustering approaches.
One Flow-Transformer for Imagination and Control
Andrii Zadaianchuk
Sai Rajeswar
Paul Hongsuck Seo
Diffusion and flow models are effective world models for visual reinforcement learning, but existing agents treat them as black-box simulato… (see more)rs, leaving the backbone’s representations unused for control. We introduce DRIFT, an online agent in which a single Flow-Transformer serves as both world model and policy backbone, trained from scratch. We find that denoising features alone are suboptimal for control; DRIFT bridges this gap with a next-latent prediction objective that gives the backbone an explicit dynamics signal. Shortcut flow matching reduces imagination to a single denoising step per frame. Across Atari 100k, Craftium, and Crafter, DRIFT is competitive with both latent-dynamics and diffusion world-model baselines.
TOOD: Task-Aware Out-of-Distribution Score Calibration for Continual Learners
Mostafa Elaraby
Samer B. Nashed
The primary challenge of continual learning (CL) systems is to learn new tasks while remaining performant on previously learned tasks. A sim… (see more)ilarly important though less well-studied aspect of CL systems is their ability to distinguish inputs that are unlikely to come from within the set of tasks the system has already encountered, often called out-of-distribution (OOD) detection. This paper presents several findings related to the dynamics of OOD detection in CL systems, causes of performance degradation over time which we call OOD forgetting (OODF), and proposed mitigation strategies for this degradation. Chiefly, we find the unintuitive result that OODF is only weakly anti-correlated with classification performance on previous tasks, suggesting that the underlying mechanisms producing OODF are distinct. Moreover, this effect is observed for both energy-based and feature-based OOD detection methods. Energy-based detectors suffer a drop in logit scale as additional tasks are learned, which we term the Confidence Gap, while feature-based detectors also degrade under a complementary effect we call Manifold Crowding. Motivated by these observations, we propose TOOD, a training-free post-hoc method that decomposes logits into per-task energy scores and re-calibrates them using replay-buffer statistics. Experiments on CIFAR-10, CIFAR-100, and a 100-task ImageNet-1K stream show that TOOD improves OOD detection performance over uncalibrated energy in most settings and ranks first or second in nine of ten CIFAR configurations, with the largest gains when the confidence gap is most severe. These results suggest that a substantial portion of OOD deterioration in continual learning arises from score miscalibration rather than from a complete loss of discriminative structure.