A field on ReadSearch
Computer Science & AI
Much of the new work in computer science and AI appears first as a preprint on arXiv. ReadSearch reads those listings every day, with papers OpenAlex files under the same subjects, and this page shows the newest it has, from machine learning and language to systems, theory and security.
The newest 1,000 papers, from 4 November 2026 to 5 November 2026: 1,000 arXiv preprints.
Newest papers, page 21
Improving Context-Shift Robustness of Convolutional Networks via Context-Regularized Cross-Entropy
Image classification models often encounter objects in diverse and unpredictable contexts at test time, which may differ substantially from those seen during training.Patch Attention Wisely: Understanding Patch Length in Attention-Based Forecasting
Attention-based time series forecasters commonly group consecutive observations into patches.RouteAlign: Aligning Task Requirements with Model Profiles for LLM Service Selection
LLM service selection requires performance evidence that reflects the demands of the current task.Reflective Nature Experiences in Virtual Reality
This paper presents the design and evaluation of an accessible virtual reality (VR) nature experience developed to promote mindfulness, reduce stress, and support emotional well-being.Uniform Three-Fold Product Expansion of Algebraic-Geometry Codes over a Fixed Field
A collection of classical codes $C_1,\dots,C_m$ has product expansion if every low-weight word in the sum of their extensions to the product space can be written as a sum of words supported on few…Regret Bounds for Profit Maximization in Bilateral Trade: Learning the Best Posted-Price Mechanism
Bilateral trade models the task of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations.NOMA Assisted Coordinated Beam Hopping for VLEO Satellite Communication Systems
This paper investigates a non-orthogonal multiple access assisted coordinated beam hopping (NOMA-CBH) scheme in multidimensional very low Earth orbit (VLEO) satellite communication systems, where…PCBRouteAgent: How Close Are LLM Agents to Becoming PCB Routing Engineers?
Automating printed circuit board (PCB) routing requires coordinating board-level connectivity decisions with geometric execution under strict design rules.BabyTheorist: A Benchmark for Learning to Theorize the World from Observation Alone
How would we know whether a machine truly understands the world?Knowing When to Teach: Learning from Teachable Prefixes in Multilingual Reasoning Distillation
On-Policy Self-Distillation (OPSD) improves reasoning by training a student on its own reasoning, using the same model conditioned on reference solutions as a teacher.Quantum Advantage with Sign-Free Proofs: An Oracle Separation between $\mathsf{StoqMA}$ and $\mathsf{MA}$
Several landmark oracle results (FOCS 2000, FOCS 2025, STOC 2026) establish strict separations along the chain $\mathsf{MA} \subseteq \mathsf{QCMA} \subseteq \mathsf{QMA}$, showing that quantum…BUMP: Brief Unexpected Mid-Interpolation Peak
We identify an intriguing phenomenon when linearly interpolating between permutation-aligned neural networks: test accuracy briefly improves near the interpolation endpoints before dropping toward…Multimodal Hierarchical Mixture-of-Experts for 3D Medical Vision-Language Modeling
Medical 3D scans and reports are inherently hierarchical, with diagnostic cues concentrated in specific anatomical regions across multiple levels of organization.SMART: State-based Multi Agent Reasoning Traces for Verification-oriented Problem-Solving
Complex problems with limited context, such as claims, require a means to obtain additional knowledge necessary for solution reasoning.Do sEMG Foundation Models Improve Cross-Subject Generalisation?
sEMG Foundation Models aim to learn general purpose representations over diverse subjects and recording conditions that boost performance on a variety of downstream tasks.Counting over Unbreakable Decompositions: A Single-Exponential Parameterized Algorithm for Minimum Bisection
The Minimum Bisection problem asks whether an $n$-vertex graph can be split into two halves with at most $k$ edges between them.Common zeros of homogeneous polynomials and the weight hierarchy of projective Reed-Muller codes
We determine the maximum number of common zeros in projective space of any set of linearly independent homogeneous polynomials of the same degree, when the degree is smaller than the cardinality of…RoboARCade: Benchmarking Agentic Robot Control
Improvements in multi-modal capabilities have enabled agents to act directly as robot policies, a setting we refer to as agentic robot control (ARC).IntentWeaver: Sustaining Coherence across Evolving Intents in Human-AI Co-Writing
Writers hold intents at many levels, from overarching goals to concrete wording, and evolve them by periodically popping back up from the text to higher-level intents.ProQuant: Progressive Quantization-aware Training for Edge MLLMs
Multi-modal large language models (MLLMs) with impressive perception and understanding capabilities will enable a range of downstream applications.
Get the few papers worth your time in Computer Science & AI every morning.
Choose your topics and ReadSearch reads the new papers in them each day, then brings you the few worth reading, each with its key finding in a sentence.