Classical statistical theory is insufficient to explain the successes of general-purpose AI models, because it depends on handcrafted inductive biases that it cannot justify. No Free Lunch (NFL) theorems force any learner that beats chance on some environments to underperform on others. We might hope that past experien...
Aram Ebtekar, Marcus Hutter, Danica J. Sutherland· 1 citation
This work proposes ABC-Align, leveraging abundant pseudo label signal to minimize variance and applying a lightweight, adaptive correction grounded in the human-labeled subset, and empirically demonstrates that ABC-Align achieves superior performance over prior semi-supervised baselines in a series of experiments on an...
Eric Frankel, Bang-Hua Zhu, Sewoong Oh et al.· 0 citations
The proposed AlphaPareto replaces the scalar reward with a multi-objective vector-valued reward that simultaneously captures predictive power, temporal stability, perturbation robustness, and diversity, and optimizes these objectives through a Pareto-regularized learning procedure.
HARMONIA achieves stronger explanation recovery than existing interpretable graph baselines while maintaining competitive predictive performance and scaling to graphs with millions of nodes, and shows that interpretable graph learning can remain both faithful and scalable without sacrificing predictive effectiveness.
Q. D. Bùi, D. Nguyen, A. Dang et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Weak-to-strong generalization (W2SG) occurs when a student trained on a teacher's predictions outperforms that teacher. We study when this happens under fully converged, ridgeless two-stage learning, with no early stopping, no explicit regularization, and no assumption that the student is more expressive than the teach...
As recursive self-improvement (RSI) rapidly advances, reliable evaluation becomes critical for guiding adaptive search. RSI typically relies on finite evaluation resources, such as fixed benchmarks, to determine which modifications are retained and what is proposed next. However, when these finite resources are repeate...
Xiao-Jing Sun, Yu-Hang Zeng, Zi-Hua She et al.· 0 citations
Prior information for real-world physical quantities is most elegantly expressed via partial differential equations (PDEs). In this paper, we propose a novel way to solve PDEs using probabilistic inference on a factor graph. In general, factor graphs provide a natural way to encode prior knowledge into a model as expli...
Анна Петровна Казачкова, Leonhard Hennicke, Rainer Schlösser et al.· 0 citations
Deep ReLU networks are piecewise-affine mappings that partition the input space into cells, each characterized by a distinct activation pattern. This structure motivates fitting a local linear model within each cell to preserve predictive accuracy while improving interpretability. The challenge is to identify regimes t...
The neural scaling law relating longer training to better performance through a power law is central to today's large language models (LLMs), yet its origin remains debated. One recent proposal is that power laws can emerge from the strong non-linearity of a single softmax head learning peaked distributions. What happe...
Yizhou Liu, Sara Kangaslahti, Jeff Gore· 0 citations
Joint-embedding predictive architectures (JEPA) have emerged as a promising self-supervised pretraining paradigm for time series, learning representations by predicting target embeddings in latent space rather than reconstructing raw signals. Yet evidence on their benefits remains mixed, and most studies test only a si...
Yu-Tong Feng, Bo-Wen Liao, See-Kiong Ng et al.· 0 citations
This work focuses on the unified model for joint estimation of eQTL mapping and gene network, and proposes a regularized multi-task graphical lasso, named L_{1-2}$ GLasso, which can obtain sparser and more accurate solutions than other commonly-used methods.
Compensated Feedback based SFL (CoeF-SFL), a communication-efficient framework that retains the end-to-end objective without any auxiliary network, is proposed and significantly outperforms auxiliary-network-based methods under the same communication frequency.
Jennifer Neville did not want to go into computer science—but that’s exactly where she landed. Neville discusses the starts and stops that led to her professional sweet spot and her work identifying “surprising failures” making it hard for AI to handle complexity. The post What AI gets wrong and what failure teaches us appeared first on Microsoft Research.