20 results for “Approximation theory”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper establishes a connection between neural network approximation of score functions and approximation of probability distributions generated by reverse diffusion models.
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.
The paper provides a polynomial-time constant-factor approximation of the Gromov-Hausdorff distance between finite point sets in the Euclidean plane.
The authors improve bounds on how well polynomials can approximate the discrete log function.
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.
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.
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.
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…
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…
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…
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…
This paper develops a continuous local model of semantic paraphrase perturbations to fool financial sentiment classifiers.
The paper establishes that computing Nash equilibria in team zero-sum games is PPAD-complete.
This paper provides a theoretical understanding of attention mechanisms in identifying relevant information from large collections of tokens.
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…
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.
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…
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…
This paper investigates the effects of synthetic data augmentation on score-based classification metrics.
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…