cs.DS

Papers

• Solving Tensor Low Cycle Rank Approximation (2023)
  Yichuan Deng et al.
  —
• Difference of Submodular Minimization via DC Programming (2024)
  Marwa El Halabi et al.
  —
• Structured Tree Alignment for Evaluation of (Speech) Constituency Parsing (2024)
  Freda Shi et al.
  —
• Ineffectiveness for Search and Undecidability of PCSP Meta-Problems (2026)
  Alberto Larrauri
  —
• Linear Regression with Unknown Truncation Beyond Gaussian Features (2026)
  Alexandros Kouridakis et al.
  —
• Adapting Dijkstra for Buffers and Unlimited Transfers (2026)
  Denys Katkalo et al.
  —
• Early Pruning for Public Transport Routing (2026)
  Andrii Rohovyi et al.
  —
• Rapid mixing in positively weighted restricted Boltzmann machines (2026)
  Weiming Feng et al.
  —
• Towards Universal Convergence of Backward Error in Linear System Solvers (2026)
  Micha{\l} Derezi\'nski et al.
  —
• Entropy Equivalence Testing (2026)
  Cl\'ement L. Canonne et al.
  —
• Learning-Augmented Online Scheduling with Parsimonious Preemption (2026)
  Mugen Blue et al.
  —
• Optimal Dimension-Free Sampling for Regularized Classification (2026)
  Meysam Alishahi et al.
  —
• Fermi-Dirac machines as quantizations of neurons (2026)
  Alexander He et al.
  —
• A computational phase transition for learning-to-sample from Ising models (2026)
  Andrej Risteski et al.
  —
• Algorithms with Polynomially-Improved Approximation Factors for the $2 \rightarrow q$ Norm, and Applications (2026)
  Samuel B. Hopkins et al.
  —
• PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting (2026)
  Steve Hanneke et al.
  —
• Parsimonious Learning-Augmented Online Metric Matching (2026)
  Yongho Shin et al.
  —
• On the Detection of Commutative Factors in Factor Graphs: Necessary and Sufficient Conditions (2026)
  Malte Luttermann et al.
  —
• Proper Agnostic Learning of Functions of Halfspaces under Gaussian Marginals (2026)
  Sergei Tikhonov et al.
  —
• Smoothed Score Queries and the Complexity of Sampling (2026)
  Jingbo Liu
  —
• Privately Estimating Monotone Statistics in Polynomial Time (2026)
  Gavin Brown et al.
  —
• Quantum principal component analysis without eigenvector recovery (2026)
  Yewei Yuan et al.
  —
• A Fresh Look at Lamarckian Evolution and the Baldwin Effect (2026)
  In\`es Benito et al.
  —
• Optimal Rates for Differentially Private Hypothesis Testing with E-values (2026)
  Ben Jacobsen et al.
  —
• Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems (2026)
  Benjamin Doerr et al.
  —
• Improved Guarantees for Heterogeneous Treatment-Effect Estimation via Matrix Completion (2026)
  Anay Mehrotra et al.
  —
• On Language Generation in the Limit with Bounded Memory (2026)
  Jon Kleinberg et al.
  —