Evaluating new large language models typically requires costly human annotation campaigns at scale. LLM-as-a-judge offers a cheaper alternative, but judge scores carry systematic errors -- such as position bias, self-preference, or intransitivity -- that can strongly miscalibrate the resulting rankings. We quantify the...
Learning from imperfect data is a central theme in machine learning, connecting practical questions of robustness to fundamental questions of learnability. Here we examine attribute noise: learning from corrupted inputs while keeping the labels intact, a setting that has received considerably less analytical attention...
Justin Tahmassebpur, Asadullah Bhuiyan, Hyejin Kim et al.· 0 citations
Web platforms run many marketing campaigns at once, and for each one they must decide which products to promote and which users to target. The best users depend on the products, and the best products on the users. The campaigns also compete with one another, because each user and each item may belong to only one of the...
Maja Lindstr\"om, Natalija Glisovic, Jan von Pichowski et al.· 0 citations
Leader-follower gradient iterations, including bilevel and two-time-scale methods, can exhibit large finite-time excursions despite asymptotic stability. For cascaded iterations with block matrix J = [[A,0],[C,D]], symmetric diagonal blocks of norm at most gamma < 1, and coupling norm at most c, we prove an exact, dime...
Ahanaf Hasan Ariq, Davide Wiest· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
We revisit the I/O complexity of attention in large language models. Given query-key-value matrices $Q,K,V\in\mathbb{R}^{n\times d}$, and a machine with fast memory size $M$, the goal is to compute the "attention matrix" $A=\text{softmax}(Q K ^{\top}/\sqrt{d}) V$ with the minimal number of data transfers between fast a...
P\'al Andr\'as Papp, Aleksandros Sobczyk, Anastasios Zouzias· 0 citations
This work presents provably tighter instantaneous regret bounds for GP upper confidence bound (GP-UCB) at any given iteration and proposes stopping criteria for GP-UCB based on this tighter bound that ensures an $\epsilon$-optimal solution with high probability $1-\delta$ upon termination.
Predictive models are central to credit risk management, where the accuracy of default-probability and loss estimates affects the profitability of lending and the stability of the financial system. Decades of benchmarking research have consolidated the state of the art, with gradient-boosting models often representing...
Bart Baesens, Andreas Goethals, Stefan Lessmann et al.· 0 citations
Recent advancements in generative AI facilitate large-scale synthetic data generation for model evaluation. However, without targeted approaches, these datasets often lack the sociotechnical nuance required for sensitive domains. We introduce NodeSyn, a methodology that pairs a fine-tuned taxonomy generator (TaG) with...
Qazi Mamunur Rashid, Xuan Yang, Zhengzhe Yang et al.· 0 citations
Accurate spatio-temporal cellular traffic analysis is fundamental to the reliable operation of modern mobile networks, as it underpins load forecasting for congestion avoidance and missing-data imputation for continuity despite transmission errors. While deeply connected, forecasting and imputation have historically ev...
Yichen Zhang, Yiyang Ni, Pengcheng Xia et al.· 0 citations
We formulate flow matching on probability measures over probability measures. Directly from the Wasserstein-on-Wasserstein (WoW) continuity equation, we show that admissible nested outer and inner couplings induce a valid metameasure flow and non-local velocity field. Validity requires neither optimal plans nor a smoot...
Moritz Piening, Richard Duong, Gabriele Steidl· 0 citations
Vision-Language Models (VLMs) face significant safety vulnerabilities from malicious prompt attacks due to weakened alignment during visual integration. Existing defenses suffer from efficiency and robustness. To address these challenges, we first propose the Multimodal Aggregated Feature Extraction (MAFE) framework th...
Peigui Qi, Kunsheng Tang, Yanpu Yu et al.· 0 citations
We introduce Heterogeneous Agent Collaborative Reinforcement Learning (HACRL), a new Reinforcement Learning from Verifiable Reward (RLVR) problem that addresses the inefficiencies of isolated multi-agent on-policy optimization. HACRL enables collaborative optimization with independent execution: heterogeneous agents sh...
Zhixia Zhang, Zixuan Huang, Gongxun Li et al.· 0 citations
A machine-learning approach called CheMeleon provides a practical way to develop new drugs or other molecules with much less detailed, expensive experimentation.
Research Manager Mike Walker reflects on a career spanning hacker culture, cybersecurity, and AI, sharing lessons about trust, teamwork, leadership, and why solving difficult problems requires curiosity, judgment, agility—and an understanding of the rules. The post Learn the rules: The hacker mindset appeared first on Microsoft Research.
Learn how Google Antigravity and our Cheminformatics Skills accelerate drug discovery workflows, search compounds, and propose novel rigidified macrocycles.
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
MIT News · Artificial Intelligence· news.mit.eduOct 27, 2026
Prabha Jha used her experience with MIT Open Learning’s program for senior executives to develop AI solutions for her employer, Verizon, and to write a book.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.