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 2
Householder Motion Embedding: Noise Modulation for Motion-Controllable Video Generation
Diffusion models for video generation have achieved remarkable success, yet precise motion control under explicit user guidance remains challenging.Provably Efficient Representation Learning for Low-Rank CMDPs
We study representation learning in low-rank Constrained Markov Decision Processes (CMDPs), where both value and reward functions are approximated by a set of unknown representation vectors, and the…Robust Ranking of Port Impacts from Impending Tropical Cyclones: A Two-Stage Recommendation System
When a tropical cyclone (TC) threatens several ports, preparedness planning depends on anticipating which ports are likely to be affected and where disruptions may last longest.Code, Commits, and Complexity in the GenAI Era: A Longitudinal Study of Team-Based Capstone Projects
Generative AI tools are now widely available to students, but little is known about how team-based project codebases have changed since they appeared.Reducing Representational Interference in Retrieval Embeddings with Trainable Prefix Tokens
Embedding models compress variable-length text into fixed-size vector representations, but this compression can entangle semantic content with residual token-level information, such as artifacts…ArtiVidRM: Verifiable Artifact-as-Rubric Reward Modeling for Explicit Quality Articulation in Video Generation
Reinforcement learning has become an effective approach for improving video generation, but its success depends heavily on reliable reward models.Take It From Here: Evaluating Coding Agents On Project Takeover
Coding agents increasingly collaborate on long-term projects.Quadratic-Time Barriers from Self-Referential SAT
Under the self-referential $K$-SAT exhaustive-search hypothesis (SRK-ESH), no uniform deterministic algorithm computes exact longest common subsequence or standard edit distance on binary strings in…Exact $\ell_p$-CVP via Euclidean SVP in Polynomial Space
We give a randomized, rank-preserving reduction from exact $\ell_p$-CVP to exact Euclidean SVP for every integer $p\ge2$.Asymptotic advantage of quantum one-way and SMP communication for total functions
We exhibit a total Boolean function on n input bits whose bounded-error quantum simultaneous-message (and hence one-way) communication complexity is in O(\sqrt n), whereas its randomised one-way…WeightLoop: Weight-Space Programming with Experimental Feedback
Weight-space programming (WSP) shows that language models can reason about and rewrite neural network weights; recursive self-improvement (RSI) motivates feedback-driven improvement.Rethinking Data Selection: The Importance of Coverage over Difficulty in LLM Fine-Tuning
Selecting high-quality training data can reduce computation cost for LLM fine-tuning.Rule-Guided and Trajectory-Aware Repair for LLM-Based HLS Generation
Large language models (LLMs) offer a promising path for directly generating functionally correct and synthesizable HLS-C from natural-language specifications.Functional Converses for Private Matrix-Product Retrieval under Library-Wide Decoder-Side Correlation
We consider private retrieval of the matrix product $A^\top B^{(θ)}$ from replicated $P_c$-colluding servers when $B^{(\ell)}=A+N^{(\ell)}$, with the innovations mutually independent and independent…Permanent and Transient Representations for Continual Reinforcement Learning
Continual Reinforcement Learning (CRL) agents struggle to adapt to new situations while retaining prior knowledge, leading to a stability-plasticity trade-off.DC-SQEM: Medial Mesh Extraction by Dual Contouring with Spherical Quadric Error Metric
The medial axis, as a compact representation, describes not only the boundary but also the interior of the shape, and has been widely used in analyzing and simplifying shapes.Where Do Reported Long-Video QA Gains Come From? A Controlled Audit of Frame Selection, Evidence Injection, and Expert Routing
Long-video question answering is usually studied as frame selection: which few frames should a vision-language model see?Last-Iterate Convergence of Stochastic Gradient Methods for Unbounded Problems
Last-iterate convergence guarantees for stochastic gradient methods have attracted significant attention as practical implementations typically return the last iterate instead of an average of the…Energy-Time Optimal Decoding Using Expander-Graph LDPC Codes and Mesh Network Architecture
Within the Thompson VLSI model, the first energy optimal decoding schemes (up to polylogarithmic factors) that also reach clock cycle lower bounds are constructed.Frustration-freeness is decidable but unprovable
The frustration-free property is valuable in quantum many-body systems, which states that its ground states simultaneously minimize all local interaction terms, even when these terms act on…
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.