ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Approximation theory”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGcs.ITstat.MLTheoreticalRecentJul 24, 2026

From Score Approximation to Distribution Approximation in Score-Based Diffusion Models

Lan V. Truong

This paper establishes a connection between neural network approximation of score functions and approximation of probability distributions generated by reverse diffusion models.

View →
cs.CCcs.DSTheoreticalRecentAug 5, 2026

On the Approximability of Boolean Max-$k$-CSP

Ainesh Bakshi

This paper presents a polynomial time algorithm for maximizing the number of satisfied constraints in a boolean constraint satisfaction problem, achieving a $(k/2^k)$-approximation.

View →
cs.CGcs.DSmath.MGTheoreticalRecentJun 15, 2026

A constant-factor approximation of the Gromov-Hausdorff distance in the plane

Sushovan Majhi

The paper provides a polynomial-time constant-factor approximation of the Gromov-Hausdorff distance between finite point sets in the Euclidean plane.

View →
cs.CCcs.CRTheoreticalRecentOct 24, 2026

Bounds on polynomial approximations of the discrete logarithm function

Swastik Kopparty, Rishabh Kothary, Ashutosh Shankar

The authors improve bounds on how well polynomials can approximate the discrete log function.

View →
cs.DScs.CCTheoreticalRecentJul 16, 2026

Semi-Streaming Matching in a Single Pass I: A New Framework for Lower Bounds via Blueprints

Sepehr Assadi, Max Jiang, Mars Xiang

The paper develops a new framework for proving lower bounds for the maximum matching problem in the semi-streaming model, improving upon the previous best known bounds.

View →
cs.PLEmpiricalRecentJun 20, 2026

Shared-Context Batched Satisfiability

Jiening Siow, Hanrui Zuo, Hanyun Jiang, Weiqi Wang +1 more

This paper studies and compares three strategies for solving shared-context batched satisfiability in program analyzers.

View →
stat.MLcs.LGEmpiricalRecentJun 12, 2026

Gradient boosting for extremes: sampling theory and application to insurance

Stéphane Lhaut, Olivier Lopez

This paper develops statistical learning theory for gradient boosting in Peaks-over-Threshold modeling using Generalized Pareto distributions, deriving error bounds and reducing gradient correlation.

View →
stat.MLcs.LGRecentJun 2, 2026

A Quantitative Approximation Framework for Flow Distillation in Diffusion Models

Weiguo Gao, Ming Li, Lei Shi, Hanfei Zhou

The paper develops a quantitative framework to analyze and improve flow distillation in diffusion models, providing stability guarantees and suggesting non-uniform time scheduling to reduce approximat…

View →
math.OCcs.LGstat.MLEmpiricalRecentJun 15, 2026

Functional Gradient Descent with Adaptive Representations

Daniel Csillag, Rodrigo Schuller, Pedro Dall'Antonia, Leonidas Guibas +2 more

This paper proposes a new functional gradient descent algorithm that adapts the representation of functional gradients over the course of optimization, providing convergence guarantees and outperformi…

View →
cs.CVRecentJun 4, 2026

Complexity-Balanced Diffusion Splitting

Noam Issachar, Dani Lischinski, Raanan Fattal

The paper introduces Complexity-Balanced Splitting (CBS), a framework that efficiently allocates model capacity across the diffusion timeline by focusing computational resources on the most complex ge…

View →
cs.ITeess.SPTheoreticalRecentJul 20, 2026

Task-Oriented Precoding for Edge Inference over Large-Scale MIMO Systems

Hongru Li, Zeyan Zhuang, Zixin Wang, Hengtao He +3 more

This paper proposes a statistical framework for designing task-aware multiple-input multiple-output (MIMO) precoders in future wireless networks using statistical channel state information and trainin…

View →
stat.MLcs.LGEmpiricalRecentJun 17, 2026

Generalised Eigenvalue Geometry of Semantic Adversarial Attacks

Martin Anthony, Kaveh Salehzadeh Nobari

This paper develops a continuous local model of semantic paraphrase perturbations to fool financial sentiment classifiers.

View →
cs.GTcs.CCTheoreticalRecentJun 15, 2026

The Computational Complexity of Team Zero-Sum Games

Ioannis Anagnostides, Ioannis Panageas, Tuomas Sandholm, Jingming Yan

The paper establishes that computing Nash equilibria in team zero-sum games is PPAD-complete.

View →
cs.LGcs.ITstat.MLTheoreticalRecentJun 21, 2026

Asymptotic Signal Subspace Recovery in Softmax Attention Models

Lan V. Truong

This paper provides a theoretical understanding of attention mechanisms in identifying relevant information from large collections of tokens.

View →
math.NAmath.OCstat.MLTheoreticalRecentJul 18, 2026

A Deep Second-Order Stochastic Residual Method for Fully Nonlinear Parabolic PDEs

Zhenhua Zhao, Jihao Long

Introduce Deep Second-Order Stochastic Residual Method (D2SRM) for high-dimensional, Hessian-dependent fully nonlinear parabolic PDEs, establish well-posedness, and develop population-level convergenc…

View →
stat.MLcs.LGmath.STTheoreticalRecentSep 25, 2026

Nonparametric In-Context Learning under Growing Geometric Complexity: Minimax Optimality and Local Geometry-Adaptivity of Transformers

Jaehee Seo, Jisu Kim

This paper studies how transformers exploit task-relevant structure in geometrically heterogeneous data and provides a new estimator and generalization bound for in-context learning.

View →
cs.CGcs.NEmath.NATheoreticalRecentJun 29, 2026

Computing the Integral R2 Indicator by Perspective Mapping and Box Decomposition

Michael T. M. Emmerich

This paper presents a bidirectional perspective mapping between continuous integral R2 computation and integration over unions of anchored axis-aligned boxes, enabling the reuse of hypervolume algorit…

View →
cs.DScs.DCTheoreticalRecentJul 27, 2026

Parallel Spectral Graph Sparsification via Low Diameter Decompositions

Yves Baumann, Gernot Zöcklein

A new solver-free parallel spectral sparsification algorithm for weighted graphs is presented, relying on low-diameter decompositions and independent sampling, eliminating dependence on target approxi…

View →
stat.MLcs.LGEmpiricalRecentJun 24, 2026

When Does Synthetic Data Augmentation Improve Score-Based Imbalanced Classification?

Zhengchi Ma, Pengfei Lyu, Anru R. Zhang

This paper investigates the effects of synthetic data augmentation on score-based classification metrics.

View →
stat.MLcs.AIcs.DSRecentMay 28, 2026

Improved Guarantees for Heterogeneous Treatment-Effect Estimation via Matrix Completion

Anay Mehrotra, Phuc Tran, Van H. Vu, Manolis Zampetakis

The paper proposes a novel, computationally efficient estimator for estimating heterogeneous treatment effects in panel data by framing the problem as matrix completion and establishing a sharp row-wi…

View →