PAPER PLAINE

Fresh research, simply explained. Updates twice daily.

MLExpert: Towards a Generalist Agentic Model for Autonomous Machine Learning Engineering

Teaching AI to autonomously design and improve machine learning systems

Researchers trained MLExpert, a specialized AI model, to autonomously run machine learning experiments and improve its own optimization strategies based on what it learns. On a standard benchmark, MLExpert nearly doubled the success rate of its base model—from 38% to 73%—matching the performance of much larger frontier AI systems, and its learned skills transferred to other optimization tasks beyond its training domain.

As AI systems increasingly optimize themselves rather than waiting for human engineers to improve them, this work demonstrates a practical path toward AI that can accelerate its own development cycles. This could compress months of experimentation into days, making advanced AI capabilities faster and cheaper to build—but also raising questions about oversight as these systems operate with less human intervention.

Language Is a Security Surface for Agent Guards

Why AI safety guards fail when users speak other languages

Security systems that guard AI agents from harmful actions change their safety decisions based on the language a user speaks — even when the actual request and actions remain identical. On rare languages like Amharic, smaller safety guards flip their verdicts up to 4.4 percentage points more often than expected by chance, while the most powerful frontier models like Gemini remain nearly unaffected.

AI agents are increasingly deployed globally, but their safety mechanisms appear engineered and tested almost entirely in English. A user in a non-English-speaking country could ask the same question that would be blocked in English and have it approved in their own language, potentially exposing them to harmful outputs. This gap widens for smaller, open-source guards that organizations with fewer resources might deploy, creating a security risk that grows with linguistic distance from English.

Statistical Mechanics of Spike Trains: Self-Consistent Activity Ensembles and Phase Transitions

How brains switch between steady and rhythmic firing modes

Researchers developed a physics-based framework for understanding when populations of neurons oscillate versus fire steadily, treating entire sequences of neural spikes as energy states similar to how physicists model physical matter. The model reveals that brain activity undergoes a phase transition—like water freezing into ice—where a competition between synaptic rules and random noise shifts neurons from one firing pattern to a completely different one.

Understanding these transitions could explain abnormal brain rhythms in epilepsy, sleep disorders, and neuropsychiatric conditions, where the brain gets stuck in pathological oscillations or fails to generate normal rhythmic activity like sleep spindles. The framework provides a new mathematical language for predicting when and why these shifts happen, potentially guiding development of therapies that nudge neural activity out of harmful states.

LIBERO-PeRM: Benchmarking Personalized Robotic Manipulation

Teaching robots to work the way individual people prefer, not just complete tasks

Researchers created the first standardized test for teaching robots to follow human preferences—like choosing a smooth motion over a fast one, or organizing items in a particular way. Current AI-powered robots fail at this when given no examples, but can learn preferences from a handful of demonstrations; however, they struggle to apply what they learned to new layouts or handle conflicting preferences.

Household robots need to adapt to how different people want tasks done, not just whether tasks get done. Without benchmarks and training data for preference learning, companies building these robots have no way to measure progress or know which approaches actually work. This benchmark gives the field a shared standard to build better robots that respect individual styles and habits.

Convergence Rates for Lasserre's Upper-Bound Hierarchy on \mathbb{R}^d with Gaussian Measure

Finding the bottom of a mountain using progressively better mathematical approximations

Mathematicians proved how fast a computational tool called Lasserre's hierarchy can narrow in on the lowest point of any polynomial function—showing it gets closer by roughly a factor of 1/r with each step of refinement. This is the first explicit speed guarantee for this method when the search space is infinite, and the researchers proved this rate cannot be improved in general.

Optimization problems—finding the best solution to a constraint—appear constantly in engineering, finance, and machine learning. This result gives practitioners a concrete guarantee: if you apply this method 100 times, you'll be roughly 100 times closer to the true answer than after just one iteration. Knowing this rate helps decide when to stop computing and accept the current best answer.

Query-Efficient Rejection Sampling for Parallel Masked Diffusion

Speeding up AI text generation without sacrificing quality or needing excessive computations

When AI models generate multiple words at once to speed things up, they typically ignore how those words relate to each other, producing biased results. Researchers developed SIRS, a new method that corrects this bias while requiring dramatically fewer computational checks—just one query instead of one per token—by cleverly reusing information the model already computes.

Faster, more accurate text generation directly reduces computational costs and energy use in AI systems while improving output quality. This matters for large-scale applications like real-time translation, chatbots, and content generation, where speed and accuracy improvements compound across millions of queries.

Recovering Reliable Supervision via Critique-Guided On-Policy Distillation

Training AI to fix its mistakes by learning from its own corrections

When teaching an AI model to solve problems by learning from its own attempts, a major flaw emerges: the teacher model gets pulled along into the student's mistakes instead of correcting course. Researchers developed CriticOPD, which has the teacher identify where the student went wrong, then watches the student rewrite the solution correctly—and learning from that revision produces measurably better results, especially on hard competition math problems.

Most AI systems today struggle with complex reasoning because the feedback they receive during training can't reliably steer them back on track once they start down the wrong path. This method directly addresses that bottleneck by forcing a real correction cycle into the training loop. Better error recovery during training means these models could solve harder problems in the real world without requiring as much human oversight or external correction data.

MLP-Initialized Reinforcement Learning for Exit Timing in SPX Short-Straddle Portfolios

Teaching AI when to close risky stock-market bets for better profits

Researchers used historical trading data to train an artificial intelligence system that decides when to close short-straddle options positions—a bet that a stock index will stay within a narrow price range. The AI system achieved 37.5% returns with a Sharpe ratio of 1.705 over two years, beating simple hold-until-expiration strategies and fixed timing rules by consistently picking better exit moments.

Options traders make money or lose it based on split-second timing decisions, and current rules of thumb often leave money on the table. This approach shows that AI trained on historical patterns can systematically improve exit timing, potentially helping portfolio managers reduce losses during volatile markets and lock in gains earlier. For active traders, even small improvements in exit timing compound into substantial differences in annual returns.

Directed percolation in higher-order social dilemmas

How group games create sudden tipping points through simple two-person interactions

Researchers discovered that dramatic phase shifts in multiplayer cooperation games don't actually require group interactions — the same explosive transitions appear in simpler two-person dynamics with short-term memory. By deriving the mathematical equations governing these systems, they showed that three-player games and their pairwise equivalents share identical tipping points, critical thresholds, and the minimum group size needed to trigger sudden behavioral collapse.

Understanding what truly drives sudden social tipping points—like rapid shifts in public opinion or cooperation breakdown—matters for predicting when societies are near the edge of major change. This finding simplifies the puzzle: planners and researchers don't need to model complex group interactions to capture these critical moments; tracking simple pairwise connections with memory is enough. That makes forecasting real-world cascades computationally feasible and helps identify which interventions might prevent unwanted social collapse.

Beyond LLM Judge: Mechanical Verification for Agentic Autoformalization

Catching mistakes in AI-written math proofs that AI judges miss

Researchers created a verification system that catches errors in mathematical proofs automatically translated into formal logic, outperforming methods that rely solely on AI judges. The system combines AI review with mechanical checks—like numerical validation and consistency testing—to identify mistranslations that language models alone overlook, and the team used it to formalize over 300 mathematical functions from the NIST reference library.

Automatically translating mathematics into formal logic could accelerate proof verification and reduce human labor, but only if the translations are correct. This method achieves lower error rates than existing approaches, making it possible to automate the creation of reliable mathematical reference libraries that researchers and engineers can trust without manual inspection of every entry.

DoReMe: Dual optimization of Reconstruction and Motion estimation for self-navigated free-breathing abdominal MRI using Gaussian Splatting

Fixing blurry MRI scans by tracking breath movement during imaging

Researchers developed a new method that reconstructs sharp abdominal MRI images while simultaneously figuring out how the patient's organs moved during breathing. Unlike older approaches that require guess-work about motion beforehand, this method learns the motion and the image together in about 90 seconds, producing clearer pictures—especially of the liver—even when the scan is shortened.

Breathing motion is the main reason abdominal MRI scans come out blurry and distorted, forcing radiologists to spend longer acquisition times and sometimes repeat scans. Faster, sharper images mean patients spend less time in the scanner, hospitals can scan more patients, and doctors get clearer pictures to spot disease. The method works without external motion sensors, making it easier to deploy in standard clinical settings.

Predicting Unseen Scientific Interactions: Conditional Flow Models Hallucinate Non-Additive Effects

Why AI models fool us by predicting accurate results while missing how drugs actually interact

Machine learning models trained to predict scientific outcomes often appear accurate overall but fail to capture how one intervention changes another's effect—a crucial scientific question. Researchers found that these models tend to invent fake interactions and struggle to predict real ones when moving beyond their training data, even when their overall predictions look correct.

This matters for drug development and biology research: a model that says two drugs work well together might be hallucinating that interaction rather than actually understanding it. If scientists rely on these predictions to test new drug combinations or cell treatments, they could waste resources pursuing effects that don't actually exist, or miss real interactions that traditional accuracy metrics hide.