PAPER PLAINE

Fresh research, simply explained. Updates twice daily.

Krylov Break Times from an Inhomogeneous Lieb--Robinson Light Cone

How long quantum computer shortcuts stay reliable before they break

Physicists have figured out when a common computational shortcut for quantum systems becomes unreliable. The shortcut—called Krylov truncation—works by approximating quantum behavior using a smaller, manageable system, but information leaks and errors grow over time. The research shows that the method breaks down after a time directly proportional to how the quantum information spreads across the system, with accuracy degrading like a round trip where information must travel out to the edge of the approximation and back.

Quantum computers and simulators rely on Krylov methods to model systems that would otherwise be too large to handle. Knowing exactly how long these approximations remain trustworthy—not just in theory but with precise bounds—lets engineers set realistic expectations for how long a calculation can run before errors accumulate beyond tolerance. This is essential for deciding whether a quantum algorithm is practical for real problems.

Sophistication in GenAI Use: Field Evidence from a Large Firm

Why some employees get far more out of AI than others

Researchers analyzed over 700,000 AI prompts from nearly 4,000 back-office employees at a large firm and found that seniority and job function—not training programs—predict how effectively people use AI. Senior workers and those in strategy-focused roles asked more sophisticated questions and got better results, while generic AI training courses produced no lasting improvement in how people worked.

Companies spending millions on AI training for their workforce may be wasting money if those programs don't address how employees' actual domain knowledge shapes their AI use. The findings suggest managers should focus on matching AI tools to senior experts and strategic teams rather than rolling out one-size-fits-all training—and that simply teaching people to use AI tools matters far less than what they already know about their work.

Successive Capacity Growth: Task-Complexity-Driven Width and Depth Expansion for Vision Transformer Encoders in JEPA World Models

AI models that grow smarter only when tasks demand it

Researchers developed a method called Successive Capacity Growth that lets AI vision models start tiny and expand only when needed, rather than being built large from the start. On complex vision tasks, the approach achieved 20% better performance while using 56 times fewer parameters than fixed large models, and even beat those large models on simpler tasks by 23%.

AI training consumes enormous computational resources and energy. This approach cuts the parameters needed by more than half while improving accuracy, which translates directly to cheaper training, faster inference, and lower energy costs. Since many real-world applications use models far more powerful than their tasks require, this adaptive scaling could make AI systems dramatically more efficient at deployment.

On supporting affine functionals for Entanglement of Formation

A mathematical trap in quantum entanglement that breaks a widely-held assumption

A basic assumption about quantum entanglement has been wrong. Many physicists have assumed that for any quantum state, you can find a mathematical tool (called a supporting affine functional) that perfectly characterizes its entanglement. This paper shows that assumption fails—even in the simplest possible case of two basic quantum particles—when those particles are in certain kinds of states.

Entanglement of Formation is a central concept in quantum information theory, used in everything from quantum computing to quantum cryptography. If the mathematical framework physicists have been using doesn't actually work as promised, then calculations and proofs relying on that framework may be unreliable. This paper forces researchers to be more careful about when they can safely use these mathematical shortcuts and identifies which quantum states need special handling.

Lowering the Barrier to AI-Driven Inspection: A No-Code Workflow for Automated Structural Defect Detection

Making AI crack detection work without learning to code

Engineers have built YOLOEZ, a free tool that spots structural defects like cracks and damage using artificial intelligence—without requiring users to write code or have machine learning expertise. It beats older computer vision methods while cutting through the technical hurdles that have kept AI inspection tools from spreading beyond research labs.

Bridges and buildings rely on spotting damage early to prevent catastrophic failure and plan repairs efficiently. Right now, structural inspections are mostly done by eye, which is slow and inconsistent. By putting AI-powered defect detection in the hands of engineers and inspectors without specialized programming skills, this tool could make inspections faster, more accurate, and cheaper—turning predictive maintenance from rare to routine across infrastructure.

SWE-Prime: Fewer Trajectories, Better Performance

Cutting training data in half actually makes AI better at fixing code

Researchers found that training AI models to fix software bugs works better when you use only 10% of successful examples—but pick them carefully. The key is filtering out steps that are inefficient or risky, even when the overall fix works, improving performance by up to 24% compared to using all the data.

Software companies spend enormous resources collecting and labeling training data for AI coding assistants. This work shows they can achieve better results with far less data, cutting costs and training time while actually improving the quality of the AI's solutions. It also reveals a blind spot: more data isn't always better if that data contains bad practices buried inside otherwise successful fixes.

Directed walks shape a universal square-root law of entropy production rate in nonreciprocal systems

Why complex systems always waste energy in predictable patterns

Systems with nonreciprocal interactions — where A influences B differently than B influences A — produce entropy (disorder and wasted energy) at rates that follow a universal mathematical pattern, regardless of how the system is organized. The researchers show that this square-root relationship emerges from the geometry of directed paths through the network, not from the system's detailed structure or how many components it has.

Understanding how biological and engineered networks waste energy matters for designing efficient systems — from neural circuits to chemical reactions to supply chains. This work reveals that the efficiency loss follows a predictable formula across radically different system types, which could help engineers set realistic performance targets and predict where to intervene to reduce waste.

A Finite Sample Analysis for Quantile Temporal Difference Learning in Distributional Reinforcement Learning

How fast AI learns to predict full outcome ranges, not just average rewards

Researchers proved that a specific learning algorithm can reliably teach AI systems to predict the full distribution of possible rewards—not just the average—even with limited training data. The algorithm converges to accurate predictions at a rate that doesn't get worse as you add more prediction points, solving a long-standing question about when and how fast this kind of learning actually works.

Distributional reinforcement learning helps AI agents make better decisions in uncertain environments by understanding the full range of what might happen, not just the typical outcome. This proof provides the first formal guarantee that the method works reliably, which gives engineers confidence to use it in real systems where data is expensive or risky to collect—like robotics or medical applications.

CorporateBench: Large-Scale Q&A Benchmarking with Temporal Knowledge Bases

Testing whether AI can actually handle the mountains of real corporate documents

Researchers created CorporateBench, a large-scale test for AI systems that answer questions about corporate documents, using over 230,000 synthetic but internally consistent papers. When tested on five major language models, performance dropped significantly as document volume grew closer to what companies actually deal with — revealing a gap between how well these systems work in labs and how they'd perform on real corporate communication networks.

Companies increasingly deploy AI to search internal emails, reports, and knowledge bases, but there's been no realistic way to test whether these systems will actually work at scale before rolling them out. CorporateBench gives developers a standardized measure to catch failures before they happen in production, potentially preventing costly mistakes like AI systems giving executives wrong answers about contracts, policy, or business decisions.

Do User-Authored Permission Policies Improve Protection Against AI Agent Overreach?

Why asking permission each time protects better than preset rules

When people create standing rules to control what AI agents can do, those rules block fewer risky actions than asking for approval each time. Participants using preset rules allowed 20 percentage points more overreach incidents to happen compared to case-by-case human review, because they kept choosing "ask me later" rather than committing to firm policies upfront.

As AI agents gain access to email, files, and payments, ordinary people will need ways to protect themselves from unintended actions. This research shows that the intuitive solution — letting people write their own permission rules once — actually fails in practice because people second-guess their own rules when faced with real decisions. Systems designers now know they need to either push users toward firmer commitments, or accept that protecting against AI overreach may require sustained human attention rather than automated policies.

Your AI, On a Dial: Controlling Investment Bias in LLMs with a Single Neuron

A single dial to make AI lean bullish or bearish on stocks

Researchers found they can control whether an AI recommends buying or selling stocks by tweaking a single neuron—without rewriting prompts or changing the model itself. The adjustment works smoothly across a spectrum from strongly bullish to strongly bearish, and it changes not just what the AI recommends but also which evidence it emphasizes and what information it searches for.

If AI systems increasingly guide real investment decisions, being able to dial their bias up or down matters for transparency and control. Right now, different AI models have hidden preferences that aren't obvious to users. A calibration dial means investors and institutions could explicitly set and audit the AI's stance—or detect when a system's recommendations are being subtly skewed without permission.

Scaling Graph Neural Networks for Friend Recommendation: Multi-Hash User Embeddings and Temporal Neighbor Sampling

Making friend suggestions work at massive scale without exploding in memory

Researchers built a friend-recommendation system that works on social networks with hundreds of millions of users by solving two critical engineering problems: compressing user identity data by 98 percent and speeding up searches through friend lists by 100-fold. In real-world tests at production scale, the system increased friend additions from recommendations by 16 percent.

Social platforms need to recommend friends to hundreds of millions of people simultaneously, but existing approaches either waste enormous amounts of memory or become too slow to serve recommendations in real time. This work makes both problems solvable without tradeoffs — the same system that fits in memory also responds fast enough for live use. Platforms can now deploy more sophisticated recommendation logic without building expensive new infrastructure.