Decision tree learning heuristics fail even in smoothed analysis for complex targets.
problem Greedy decision tree learning heuristics fail for complex target functions in the smoothed analysis model.
method Construct counterexamples and analyze the behavior of heuristics in the smoothed setting and agnostic setting.
result Greedy decision tree learning heuristics can build trees of exponential depth before achieving high accuracy for certain complex target functions.
Survey on harmonic maps in non-smooth spaces, focusing on rigidity.
problem Rigidity phenomena in non-smooth spaces.
method Regularity theory of harmonic maps to non-smooth targets.
result Generalizations of Margulis superrigidity and holomorphic rigidity of Teichmüller space.
New analysis of Langevin Monte Carlo via convex optimization.
problem Sampling from logconcave smooth and non-smooth target distributions.
method Formulation as a convex optimization problem, analysis using convex optimization techniques.
result Non-asymptotic analysis of Unadjusted Langevin Algorithm and new sampling methods.
SIXO improves inference by learning smoothing distributions from all observations.
problem Inference limitations due to ignoring future observations in filtering distributions.
method Density ratio estimation to warp filtering distributions into smoothing distributions, then use SMC with learned targets.
result Proves tighter log marginal lower bounds and more accurate inferences and estimates.
Proposes a new method for estimating non-pathwise differentiable functional parameters.
problem Estimating dose-response curves for continuous exposure.
method Targeted Highly Adaptive Lasso (HAL) for non-pathwise differentiable functional parameters.
result The Targeted HAL-MLE achieves dimension-free rates up to log(n) factors and outperforms other methods in simulations.
Analyzes smoothness and classification of maps between manifolds.
problem Analyzing interpolating sesqui-harmonic maps between Riemannian manifolds.
method Derives a conservation law and uses it to show smoothness of weak solutions; obtains classification results.
result Smoothness of weak solutions and classification results for interpolating sesqui-harmonic maps.
We establish linear regret bounds for convex smooth losses using Fenchel-Young losses.
problem Establishing linear regret bounds for convex smooth losses.
method Constructing a convex smooth surrogate loss using Fenchel-Young losses generated by the convolutional negentropy.
result We derive a smooth loss with a linear surrogate regret bound.
Study geometric equivalence of smooth map germs.
problem Equivalence relations among smooth map germs with respect to G-structures.
method Generalization of right-left equivalence (A-equivalence) to include geometric structures.
result Interesting applications of these equivalence relations.
A new method for generating samples without training, using smoothed score matching.
problem Generating samples efficiently and without training.
method Moment-matched score-smoothed overdamped Langevin dynamics (MM-SOLD).
result The method enables fast, robust, training-free sampling with competitive sample fidelity and diversity.
New method samples from piecewise smooth distributions using Hamiltonian Monte Carlo.
problem Sampling from distributions with discontinuous gradients.
method Generalized Randomized Hamiltonian Monte Carlo (GRHMC) for piecewise smooth targets.
result GRHMC processes sample from piecewise smooth target distributions with the desired distribution as the invariant distribution.
SATL adapts to varying smoothness in hypothesis transfer learning.
problem Fixed kernel regularization fails in varying smoothness settings.
method Proposes SATL, a two-phase KRR algorithm with adaptive Gaussian kernels.
result SATL achieves minimax optimality with matching upper and lower bounds.
MALA mixes efficiently under smoothness and isoperimetry assumptions.
problem Sampling from target densities efficiently.
method Metropolis-Adjusted Langevin algorithm (MALA) with smoothness and isoperimetry assumptions.
result MALA mixes in $O\left(\frac{(LΥ)^{\frac12}}{ψ_μ^2} \log\left(\frac{1}ε
ight)
ight)$ iterations.
Improves probability distribution compression with KT algorithm.
problem Efficiently compressing probability distributions.
method Kernel thinning (KT) algorithm with four improvements.
result KT yields tighter, dimension-free guarantees for any kernel.
Label smoothing improves model robustness against misspecification.
problem Improving model robustness against model misspecification.
method Introducing modified label smoothing (MLSLR) that maintains consistent probability estimation while modifying the loss function.
result MLSLR exhibits higher robustness against model misspecification than conventional label smoothing.
SOOTT framework optimizes target tracking with robust and learning-augmented algorithms.
problem Optimizing target tracking in dynamic environments with adversarial perturbations.
method Integrates robust and learning-augmented algorithms for online decision-making.
result CoRT learning-augmented algorithm strictly improves over robust BEST when predictions are accurate.
New method accelerates diffusion models for broader target distributions.
problem Current diffusion models have limited acceleration for certain target distributions.
method Developed a novel accelerated stochastic DDPM sampler.
result Achieved accelerated performance for three broad distribution classes.
Paper proves smoothness for variational inference, giving convergence guarantees.
problem Proving convergence guarantees for black-box variational inference.
method Describes gradients in an inner-product space, using Bessel's inequality.
result Objective is M-Lipschitz smooth if target is, excluding entropy.
We study the propagation of bosonic strings in singular target space-times. For describing this, we assume this target space to be the quotient of a smooth manifold M by a singular foliation F on it. Using the technical tool of a gauge theory, we propose a smooth functional for this scenario, such that the p…
The paper improves SVM learning rates for anisotropic Gaussian kernels.
problem Nonparametric regression with anisotropic Gaussian kernels.
method Establishing almost optimal learning rates for functions in anisotropic Besov spaces.
result Optimal learning rates up to logarithmic factors, faster than Sobolev space-based rates.
GS-B3SE improves label shift estimation by smoothing priors on a graph.
problem Label shift adaptation when source and target distributions share conditional but not marginal probabilities.
method Graph-Smoothed Bayesian Black-Box Shift Estimator (GS-B3SE) places Laplacian-Gaussian priors on log-priors and confusion-matrix columns tied by a label-similarity graph. result GS-B3SE produces a tractable posterior with HMC or Newton-CG schemes, proving identifiability, contraction, and robustness. CoSCA improves unsupervised domain adaptation by better aligning ambiguous target samples.
problem Missing alignment of ambiguous target samples in unsupervised domain adaptation.
method CoSCA explicitly incorporates intra- and inter-class domain discrepancy, estimating label hypotheses and optimizing a contrastive loss with MMD for better global alignment.
result CoSCA outperforms state-of-the-art approaches in producing more discriminative features.
SPH-ParVI uses fluid dynamics to sample unknown densities efficiently.
problem Sampling partially known densities or using gradients in probabilistic models.
method Smoothed Particle Hydrodynamics (SPH) for modeling fluid dynamics to approximate target densities.
result SPH-ParVI provides fast, flexible, scalable, and deterministic sampling for Bayesian inference and generative models.
Label smoothing improves model calibration and generalization but harms distillation.
problem Understanding the effects of label smoothing on model calibration and distillation.
method Empirical evaluation and visualization of network representations.
result Label smoothing improves model calibration but harms knowledge distillation.
Deep learning performs well on high-dimensional data with anisotropic smoothness.
problem Understanding the performance of deep learning on high-dimensional datasets with varying smoothness.
method Investigated approximation and estimation errors in anisotropic Besov spaces.
result Deep learning's performance depends on the average smoothness, avoiding curse of dimensionality.
New method approximates sampling from smooth potential distributions using a vanishing penalty.
problem Sampling from smooth potential distributions on high-dimensional spaces.
method Penalized Langevin dynamics (PLD) with vanishing penalty.
result Established upper bound on Wasserstein-2 distance for PLD approximation.
Paper analyzes subsampling for regression with low smoothness, achieving good rates with minimal regularization.
problem Regression with non-smooth target functions in misspecified kernel settings.
method Nyström subsampling approach under general source conditions, focusing on minimal regularization.
result Achieves good learning rates for a wide range of source conditions with one regularization parameter.
New method accelerates Bayesian imaging using Langevin sampling.
problem Bayesian inference in imaging inverse problems with convex geometry.
method Stochastic relaxed proximal-point iteration targeting posterior distribution.
result Accelerated convergence for κ-strongly log-concave targets. TT-DAC-PS: A deterministic actor-critic approach for optimal trade execution
problem Optimal execution of large stock sell programs
method Twin-Target Deterministic Actor-Critic with Policy Smoothing
result Reduces mean implementation shortfall percentage
Flow matching adapts to manifold structures without diffusion.
problem Theoretical understanding of flow matching in manifold-supported settings.
method Flow matching with linear interpolation on smooth manifolds, analyzing velocity field and density estimator.
result Non-asymptotic convergence guarantee and statistical consistency of flow matching on manifolds.
The paper develops a minimax optimal method for high-dimensional regression using auxiliary data.
problem High-dimensional additive regression with heavy-tailed errors and transfer learning.
method Smooth backfitting estimator with local linear smoothing, followed by a two-stage estimation method.
result The method achieves the minimax optimal rate under certain conditions.
The paper improves generalization bounds for domain adaptation.
problem Improving generalization bounds for domain adaptation under practical conditions.
method Derives generalization bounds for domain adaptation based on finitely many moments and smoothness conditions.
result Obtains generalization bounds for domain adaptation.
New analysis shows transfer learning can significantly reduce sample size for complex models.
problem Reducing sample size needed for complex models like large language models.
method Optimal transport viewpoint applied to analyze transfer learning efficiency.
result Transfer learning can achieve better sample efficiency for complex models.
Gibbs sampler mixes quickly for certain smooth distributions.
problem Drawing samples from log-smooth log-concave distributions.
method Analyzes Gibbs sampler on log-smooth and strongly log-concave distributions.
result Gibbs sampler mixes in O⋆(κ2n7.5) steps. LMC algorithm converges to target in Chi-squared and Renyi divergence.
problem Sampling from target distribution using LMC with strong dissipativity and smoothness conditions.
method LMC algorithm with strong dissipativity and first-order smoothness, initialized with Gaussian.
result LMC reaches ε-neighborhood of target in Chi-squared and Renyi divergence in O(λ²dε⁻¹) steps.
Method optimizes diffusion model generation to meet user preferences.
problem Optimizing diffusion model generation with only black-box target scores.
method Covariance-adaptive sequential optimization algorithm for black-box optimization.
result Proves superior performance in achieving better target scores.
New method estimates treatment effects over time for survival data, improving accuracy and smoothness.
problem Estimating treatment effects over time for survival data with left truncation and right censoring.
method surv-iTMLE, a targeted learning procedure for estimating conditional survival probabilities.
result surv-iTMLE outperforms existing methods in bias and smoothness of time-varying effect estimates.
The paper generalizes Reeb spaces for special generic maps and lifts smooth functions.
problem Constructing lifts of smooth maps, especially Morse functions.
method Defining and generalizing quotient maps onto Reeb spaces of special generic maps and constructing lifts.
result Lifts of Morse functions can be constructed using the generalized maps.
The paper explores how to extrapolate from limited data points using causal mechanisms.
problem Handling distribution shifts with limited target samples.
method Formulates the extrapolation problem with a latent-variable model embodying the minimal change principle in causal mechanisms, and identifies conditions for identification.
result Theoretical understanding and practical methods for extrapolation without requiring an on-support target distribution.
New method samples from non-log-concave distributions with weak dissipativity.
problem Sampling from distributions that are not log-concave and weakly dissipative.
method Taming scheme tailored to growth and decay properties of the target distribution.
result Explicit non-asymptotic guarantees for KL, TV, and Wasserstein distances.
Smooth FFT from B-fields and D-branes.
problem Constructing a smooth functorial field theory from B-fields and D-branes.
method Definition of a smooth bordism category, transgression, functoriality, thin homotopy invariance, positive reflection structure.
result Generalizes open-closed TQFTs to include target spaces and open strings.
New SQ lower bound shows complexity nearly matches known upper bound for smoothed agnostic learning.
problem Smoothed agnostic learning of halfspaces under subgaussian distributions.
method Statistical Query (SQ) lower bound using moment-matching hard distribution and linear programming duality.
result First non-trivial lower bound on complexity nearly matches known upper bound.
Neural networks outperform NTK on compositional tasks, revealing a complexity gap.
problem Understanding the performance gap between neural networks and NTK on tasks with compositional structure.
method Characterized Fourier and architectural complexities, and analyzed the minimax rates of the architecture class.
result The NTK estimator is exponentially sub-optimal compared to the minimax floor when complexities decouple.
Unified approach for sampling non-differentiable and heavy-tailed targets.
problem Sampling non-differentiable and heavy-tailed distributions using Langevin algorithms.
method Anchored Langevin dynamics, which modifies the Langevin diffusion with a smooth reference potential and multiplicative scaling.
result Non-asymptotic guarantees in the 2-Wasserstein distance to the target distribution.
We establish conditions for a continuous map of nonzero degree between a smooth closed manifold and a negatively curved manifold of dimension greater than four to be homotopic to a smooth cover, and in particular a diffeomorphism when the degree is one. The conditions hold when the volumes or entropy-volumes of the two…
This study models target trajectories using stochastic processes for efficient tracking.
problem Efficiently modeling and predicting target trajectories in continuous time.
method Decomposes trajectory modeling into deterministic and stochastic components using Gaussian or Student's-t processes. result Demonstrates superior performance in tracking maneuvering targets compared to existing methods.
New finding: Perceptually-aligned gradients occur in adversarially-robust classifiers.
problem Understanding adversarial robustness in neural networks.
method Investigated perceptual alignment in adversarially-trained and smoothed classifiers.
result Perceptually-aligned gradients are a general property of robust classifiers.
The paper derives error bounds for piecewise smooth and switching regression models.
problem Regression problems with target functions switching between different modes.
method Derives generalization error bounds using Rademacher complexities and chaining arguments.
result Error bounds with radical dependency on the number of modes for piecewise smooth regression, and linear dependency for switching regression.
The study proves Liouville-type theorems and Bochner formulas for harmonic maps into CAT(κ) spaces.
problem Analyzing harmonic maps from Riemannian polyhedra into CAT(κ) spaces.
method Computing a target variation formula to derive Liouville-type theorems and Bochner formulas.
result Proves Liouville-type theorems and Bochner formulas for harmonic maps into CAT(1) spaces.