001 A frugal primal-dual splitting with minimal lifting over arbitrary rooted trees OpenAlex Paper Feng Xue, Hui Zhang Jul 21 002 Finite-Moment Identifiability and Depth-Sensitive Recovery of Edge Failures from Boundary Heat Observations OpenAlex Paper Abraham Rubinestock Jul 20 003 Machine-Checked Scalar Foundations for SGD Analysis OpenAlex Paper Tamás Nagy Jul 20 004 Machine-Checked Scalar Foundations for SGD Analysis OpenAlex Paper Tamás Nagy Jul 20 005 Bounded Fabrication and the Limits of Authenticity Detection OpenAlex Paper T. S. Eden Jul 19 006 Bounded Fabrication and the Limits of Authenticity Detection OpenAlex Paper T. S. Eden Jul 19 007 Finite-Moment Identifiability and Depth-Sensitive Recovery of Edge Failures from Boundary Heat Observations OpenAlex Paper Abraham Rubinestock Jul 19 008 EML-AirComp: Layered Over-the-Air Computation from a Single Nomographic Gate OpenAlex Paper Onur Günlü Jul 17 009 Uniform Row Sampling for Column Subset Selection: Sufficient Conditions Motivated by Problem 4.4 OpenAlex Paper Peng Qi Jul 17 010 Uniform Row Sampling for Column Subset Selection: Sufficient Conditions Motivated by Problem 4.4 OpenAlex Paper Peng Qi Jul 17 011 Revisiting column subset selection through the lens of submodularity OpenAlex Paper Ilse C. F. Ipsen, Arvind K. Saibaba Jul 15 012 Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values OpenAlex Paper Phillip Kerger Jul 14 013 Reproducing the k-copwin Algorithm: Theory vs. Implementation OpenAlex Paper Meagan Mann, Christian Muise et al. Jul 14 014 Anytime Analysis on BinVal: Adaptive Parameters Help OpenAlex Paper Timo Kötzing, Jurek Sander Jul 10 015 Finding Simple Proofs for First-Order Optimization OpenAlex Paper Daniel Berg Thomsen, Manu Upadhyaya et al. Jul 9 016 Learning Unions of Intersecting Affine Modules in One Dimension with Queries OpenAlex Paper Eva González, Montserrat Hermo et al. Jul 9 017 Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation OpenAlex Paper Oded Schwartz, Eyal Zwecher Jul 9 018 Adversarial Robustness for Small Frequency Moments and a Weak Equivalence Theorem for Turnstile Streams OpenAlex Paper Elena Gribelyuk, Honghao Lin et al. Jul 7 019 Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width OpenAlex Paper Thobias Kvalvik Høivik, Erlend Raa Vågset Jul 3 020 Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles OpenAlex Paper Deeparnab Chakrabarty, Hang Liao Jul 1 021 Anti-Random Complexity Theory: A Unified Dual Reversal Framework of BPP via Measure-Generated Computation and Adversarial Path Geometry OpenAlex Paper Jincheng Zhang Jun 29 022 Anti-Random Complexity Theory: A Unified Dual Reversal Framework of BPP via Measure-Generated Computation and Adversarial Path Geometry OpenAlex Paper Jincheng Zhang Jun 29 023 Computing Lewis weights to high precision using local relative smoothness OpenAlex Paper Sander Gribling, Aaron Sidford et al. Jun 28 024 Learning Unions of Intersecting Affine Modules in One Dimension with Queries OpenAlex Paper Eva González, Montserrat Hermo et al. Jun 27 025 One Hex reduction to rule them all: Quoridor, Maze Attack, Pinko Pallino and Blockade are PSPACE-complete OpenAlex Paper Francesco Carboni, Daniele Muscillo Jun 27 026 Provable Reductions in TFNP OpenAlex Paper Noah Fleming, Stefan Grosser et al. Jun 26 027 Sharp First-Order Lower Bounds under Sublevel $α$-Polyak-Lojasiewicz Conditions OpenAlex Paper Saeed Masiha, Negar Kiyavash et al. Jun 26 028 A Solution to the Subset Sum Game Complexity OpenAlex Paper houssem drablia Jun 23 029 A Solution to the Subset Sum Game Complexity OpenAlex Paper houssem drablia Jun 23 030 Complexity of Clique-Guarded First-Order Logic with Counting OpenAlex Paper Steffen van Bergerem, Johannes Friedrich Lange et al. Jun 23 031 Flood-It with Jewelry -- Characterizing the Game Complexity for Cograph Generalizations OpenAlex Paper Martin Darmüntzel, Christian Rosenke et al. Jun 22 032 Representation-Sensitive Weihrauch Complexity in Tame Learning: Pair Homogeneity and Definability OpenAlex Paper Alfredo Sepulveda-Jimenez Jun 22 033 Representation-Sensitive Weihrauch Complexity in Tame Learning: Pair Homogeneity and Definability OpenAlex Paper Alfredo Sepulveda-Jimenez Jun 22 034 Representation-Sensitive Weihrauch Complexity in Tame Learning: Pair Homogeneity and Definability OpenAlex Paper Alfredo Sepulveda-Jimenez Jun 22 035 Representation-Sensitive Weihrauch Complexity in Tame Learning: Pair Homogeneity and Definability OpenAlex Paper Alfredo Sepulveda-Jimenez Jun 22 036 Withdrawal Notice: Appendix: Discreteness Arises Not from an Outer Bound but from Nodes — Discreteness as Nodes Generated by Binarity OpenAlex Paper Noriaki Kihara Jun 19 037 Appendix: Discreteness Arises Not from an Outer Bound but from Nodes — Discreteness as Nodes Generated by Binarity OpenAlex Paper Noriaki Kihara Jun 18 038 The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementations OpenAlex Paper Kwanghoo Choo Jun 18 039 The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementations OpenAlex Paper Choo, Kwanghoo Jun 17 040 The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementations OpenAlex Paper Choo, Kwanghoo Jun 17 041 The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementations OpenAlex Paper Choo, Kwanghoo Jun 17 042 An Epistemic Analysis of Random Coordinated Attack OpenAlex Paper Sophia Knight, David Lehnherr et al. Jun 16 043 The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementations OpenAlex Paper Choo, Kwanghoo Jun 16 044 The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementations OpenAlex Paper Choo, Kwanghoo Jun 15 045 The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementations OpenAlex Paper Kwanghoo Choo Jun 15 046 The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementations OpenAlex Paper Choo, Kwanghoo Jun 15 047 The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementations OpenAlex Paper Choo, Kwanghoo Jun 15 048 Fourier Ratios of Graph Kernels: Energy Bounds, Optimal Labelings, and Recovery OpenAlex Paper Vishal Gupta, Alex Iosevich Jun 13 049 Degree-Four Vector-Coordinate SoS Cannot Detect the MUB Upper Bound OpenAlex Paper Shreyhaan Sarkar Jun 11 050 Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products OpenAlex Paper Christoper Musco, Indu Ramesh Jun 10 051 Improved Approximation Algorithms for Non-preemptive Throughput Maximization OpenAlex Paper Alexander Armbruster, Fabrizio Grandoni et al. Jun 9 052 On Parallel and Batch-Cutting Strategies for Norm-Minimization-Based Convex Vector Optimization OpenAlex Paper Mohammed Alshahrani Jun 4 053 On Interactions of Vapnik-Chervonenkis and Littlestone Dimensions with Logic and Combinatorics OpenAlex Paper Olga Medrano Martín del Campo Jun 1 054 RGDBEK: Randomized Greedy Double Block Extended Kaczmarz Algorithm With Hybrid Parallel Implementation and Applications OpenAlex Paper Aneesh Panchal, Ratikanta Behera Jun 1 055 pac-learning-lean: Formal PAC Learning Bounds in Lean 4 OpenAlex Paper Ben Cassie Jun 1 056 pac-learning-lean: Formal PAC Learning Bounds in Lean 4 OpenAlex Paper Ben Cassie Jun 1 057 Multi-iteration Stochastic Optimizers OpenAlex Paper André Gustavo Carlon, Luis Espath et al. May 29 058 Spectral density estimation for normal matrices OpenAlex Paper Cameron Musco, Christopher Musco et al. May 29 059 The Mathematics of Large Language Models II: Concentration — A Depth Lower Bound for Robust Classification OpenAlex Paper Miquel Noguer Alonso May 29 060 The Mathematics of Large Language Models II: Concentration — A Depth Lower Bound for Robust Classification OpenAlex Paper Miquel Noguer Alonso May 29