No bi-Lipschitz homeomorphism can unwind spirals with sub-exponential winding radii.
problem Unwinding spirals with sub-exponential winding radii.
method Analyzing bi-Lipschitz homeomorphisms of R^2.
result No bi-Lipschitz homeomorphism exists for spirals with sub-exponential winding radii.
Using a family of modified Weibull distributions, encompassing both sub-exponentials and super-exponentials, to parameterize the marginal distributions of asset returns and their multivariate generalizations with Gaussian copulas, we offer exact formulas for the tails of the distribution P ( S ) P(S) P ( S ) of returns S S S of a port…
The study provides error bounds for the generalized Lasso with sub-exponential data.
problem Analyzing the generalized Lasso under sub-exponential data distributions.
method Non-asymptotic analysis using generic chaining-based proof strategy.
result Error bounds for the generalized Lasso can be controlled by two complexity parameters.
We study deep Bayesian neural networks with Gaussian priors, revealing heavy-tailed unit activations.
problem Characterizing regularization effects in deep Bayesian neural networks.
method Investigation of deep Bayesian neural networks with Gaussian weight priors and ReLU-like nonlinearities.
result The prior distribution on units becomes increasingly heavy-tailed with depth, influencing activation patterns.
Proves new concentration inequalities for sub-gaussian and sub-exponential variables.
problem Understanding functions of independent random variables better.
method Sub-gaussian and sub-exponential conditions, Rademacher complexities, Lipschitz function classes.
result Extension of Rademacher complexities to unbounded sub-exponential distributions.
Novel bounds for SGLD show generalization error decreases with more samples.
problem Understanding the generalization error of SGLD in non-convex optimization.
method Information-theoretic approach focusing on Kullback-Leibler divergence and sub-exponential loss function.
result Time-independent generalization bounds for SGLD, independent of step size and number of iterations.
The Langevin Algorithm's stationary distribution is shown to be sub-exponential or sub-Gaussian under certain conditions.
problem Understanding the properties of the Langevin Algorithm's stationary distribution.
method Analysis using a rotation-invariant moment generating function (Bessel function) to study the stationary dynamics of the Langevin Algorithm.
result Concentration results for the Langevin Algorithm's stationary distribution π η π_η π η are established, showing it is sub-exponential or sub-Gaussian under convex or strongly convex potential conditions. Characterizes uncertainty in low-rank matrix completion with noisy data.
problem Uncertainty quantification in low-rank matrix completion with heterogeneous sub-exponential noise.
method Characterizes the distribution of estimated matrix entries under low-rank estimators with heterogeneous sub-exponential noise.
result Explicit formulas for the distribution of estimated matrix entries under Poisson and Binary noise.
Parameter-free online convex optimization with sub-exponential noise achieves optimal regret.
problem Online convex optimization with sub-exponential noise, especially when subgradients are unbounded.
method Designing a novel parameter-free algorithm BANCO via a reduction to betting on noisy coins.
result BANCO achieves the optimal regret rate in the problem of unconstrained online convex optimization with sub-exponential noise.
Paper establishes universal lower bounds and optimal rates for clustering sub-exponential mixture models.
problem Achieving optimal error rates in clustering sub-exponential mixture models.
method Establishes universal lower bounds and demonstrates iterative algorithms' optimality in sub-exponential mixture models.
result Iterative algorithms achieve the universal lower bound in sub-exponential mixture models.
SGD converges to an invariant distribution with sub-Gaussian or sub-exponential properties.
problem Optimizing smooth and strongly convex objectives using SGD.
method Analysis through Markov chains, focusing on convergence and concentration properties.
result SGD iterates and their invariant limit distribution inherit sub-Gaussian or sub-exponential concentration properties.
New method tests fit between source and target populations.
problem Testing goodness-of-fit under covariate shift.
method Truncated importance-weighting kernel ridge regression with multiplier bootstrap.
result Valid and sharp confidence sets for regression function.
Paper develops methods for testing fit under shifted covariate distributions.
problem Testing goodness-of-fit under covariate shift with distribution mismatch.
method Truncated importance-weighting kernel ridge regression with multiplier bootstrap.
result Valid and sharp confidence sets for regression function constructed.
Sharp concentration inequalities for sub-Orlicz random variables with phase transition at α=2.
problem Developing concentration inequalities for sub-Orlicz random variables with phase transition.
method New theoretical analysis framework involving variance and min/max functions of Orlicz tails.
result Sharp concentration inequalities with phase transition at α=2 for sub-Orlicz random variables.
New algorithm for HOMFLY-PT polynomial reduces computation time.
problem Computing HOMFLY-PT polynomial is #P-hard.
method Fixed-parameter tractability in treewidth.
result HOMFLY-PT polynomial can be computed efficiently using sub-exponential time algorithm.
Paper optimizes change-point detection using learned distributions from training sequences.
problem Optimal change-point detection with unknown pre- and post-change distributions.
method Designs a change-point estimator using training sequences and test sequences.
result Optimal confidence width characterized as a function of undetected error.
Quantifies polynomial approximation rates for smooth functions under various distributions.
problem Approximating smooth functions with polynomials under different distributional constraints.
method Develops a quantitative analogue of Carleman's theorem using complex analysis.
result Establishes superexponential rates of approximation for certain function classes over general distributions.
We show that the regulator, which is the difference between the homology torsion and the combinatorial Ray-Singer torsion, of fnite abelian coverings of a fixed complex has sub-exponential growth rate.
New algorithms achieve high-probability parameter-free regret in online convex optimization with heavy-tailed data.
problem Achieving high-probability parameter-free regret in online convex optimization with heavy-tailed data.
method Developed new regularization techniques to handle exponentially large iterates and heavy-tailed subgradients.
result Achieved regret bound of O ( ∥ u ∥ T 1 / p log ( 1 / δ ) ) O(\| \mathbf{u} \| T^{1/\mathfrak{p}} \log (1/δ)) O ( ∥ u ∥ T 1/ p log ( 1/ δ )) with high probability for subgradients with bounded p t h p^{th} p t h moments. We develop a new bound for estimating CVaR from samples of an unbounded random variable.
problem Estimating CVaR from i.i.d. samples of an unbounded random variable.
method Derive a one-sided concentration bound for a CVaR estimator.
result A novel concentration bound for CVaR estimation.
Kernel thinning compresses distributions more effectively than i.i.d. sampling or standard thinning.
problem Efficiently compressing distributions for better sampling and integration accuracy.
method Introduces kernel thinning, a procedure that compresses an n-point approximation of a distribution into a sqrt(n)-point approximation with comparable integration error.
result Kernel thinning achieves a maximum discrepancy in integration error of O_d(n^(-1/2) sqrt(log n)) in probability for compactly supported distributions and O_d(n^(-1/2) (log n)^(d+1/2) sqrt(log log n)) for sub-exponential distributions.
Study finds best linear model in high dimensions using PGD.
problem Finding the best linear model in high-dimensional data.
method Projected gradient descent (PGD) algorithm for estimating the population minimizer.
result PGD achieves linear convergence and data-dependent error bounds.
This paper extends the convergence analysis of Langevin Monte Carlo beyond Poincaré inequalities.
problem Analyzing convergence of Langevin Monte Carlo under various functional inequalities.
method Establishing upper and lower bounds for Langevin diffusions and LMC under weak Poincaré inequalities.
result Explicitly quantifies the effect of the initializer on the performance of LMC algorithm.
Analytic networks with bounded coefficients can't outperform polynomial approximations.
problem Approximation limits of neural networks with analytic activation functions under coefficient constraints.
method Deterministic analysis using comparison argument and Bernstein-type estimates.
result Networks with analytic activation functions and controlled coefficients cannot outperform classical polynomial approximation rates on non-analytic targets.
Annealed Entropic Allocation improves ranking and selection by mitigating hard switching and improving finite-budget discrimination.
problem Sequential budget allocation in ranking and selection
method Annealed weighted soft-min framework
result Surrogate converges uniformly to the hard minimum, soft-min weights concentrate on active challengers, and target allocation map is continuous.
The paper explores how benign overfitting occurs in heavy-tailed input distributions.
problem Understanding overfitting in heavy-tailed input distributions.
method Analysis of maximum margin classifiers on unregularized logistic loss with gradient descent.
result Linear classifiers trained under certain conditions can asymptotically achieve the noise level as misclassification error.
Generative Adversarial Networks improve robust statistics for various distributions.
problem Estimating unknown parameters in adversarially corrupted samples.
method Designing GANs with specific loss functions for robust estimation.
result Extends robust estimation to broader families of distributions.
The paper introduces a new method for tail bounds of random vectors and matrices.
problem Estimating norms of random vectors and matrices under moment assumptions.
method Variational tail bounds for norms of random vectors and matrices.
result Dimension-free concentration inequalities for various norms of random vectors and matrices.
New estimator for mean of random matrices with heavy tails.
problem Outliers in data affect traditional mean estimators.
method Sub-Gaussian or sub-exponential concentration estimator.
result Estimator performs well even with heavy-tailed data.
Paper studies early-stopped mirror descent for noisy sparse phase retrieval.
problem Recovering a sparse signal from noisy quadratic measurements.
method Early-stopped mirror descent with hyperbolic entropy mirror map.
result Achieves nearly minimax-optimal rate of convergence for k k k -sparse signals. Extends Minkowski stability proof to minimal decay assumptions.
problem Global stability of Minkowski spacetime with minimal decay.
method Extends Christodoulou-Klainerman's proof to minimal decay assumptions.
result Exterior stability of Minkowski holds with borderline decay.
New method creates vacuum data at minimal and borderline decay thresholds.
problem Creating vacuum initial data at specific decay thresholds.
method Conical solution-operator method applied to vacuum asymptotically flat initial data.
result Demonstrates global and exterior stability of Minkowski spacetime.
Unique solutions found for wave-like decaying null infinity equations.
problem Wave-like decaying null infinity equations with spherically symmetric Einstein-scalar-field.
method Local and global unique solutions for small initial data.
result Sharp decaying condition for unique solutions.
New findings on flatness of certain metrics with fast decay.
problem Rigidity of positive mass theorem under fast metric decay.
method Considered metrics with nonnegative scalar curvature and rapid decay at infinity.
result Any such metric is necessarily flat in dimensions 4 and higher if decay rate exceeds Schwarzschild metric.
A novel algorithm minimizes regret in a multi-agent bandit problem with time-varying random graphs and heterogeneous rewards.
problem Minimizing regret in a multi-agent multi-armed bandit problem with time-varying random graphs and heterogeneous rewards.
method Introduces a novel algorithmic framework combining averaging-based consensus with a weighting technique and upper confidence bound.
result Derives optimal instance-dependent regret upper bounds of order log T \log{T} log T in both sub-gaussian and sub-exponential environments. Study on curvature decay in steady Ricci solitons, proving dichotomy.
problem Curvature decay in steady Ricci solitons.
method Established a dichotomy for curvature decay in specific types of solitons.
result Proved a dichotomy on curvature decay for certain steady Ricci solitons.
Study on decay rates of higher derivatives for nonlinear Dirac equations.
problem Estimating decay rates of higher derivatives of solutions to nonlinear Dirac equations.
method Similar to Li and Zang's method, focusing on 'good' spin null form.
result Obtained decay rates of higher derivatives of solutions.
Cautious Weight Decay modifies weight decay for better optimization.
problem Improving optimization in deep learning models.
method Applies weight decay selectively based on parameter sign alignment.
result Consistently improves model performance across various tasks and scales.
New proof shows certain solitons must be symmetric if curvature decays linearly.
problem Understanding noncompact steady Ricci solitons with specific curvature properties.
method Proved that nonnegative curvature operator and linear curvature decay imply rotational symmetry.
result Noncompact κ-noncollapsed steady Ricci solitons with nonnegative curvature operator and linear curvature decay must be rotationally symmetric.
Study on scalar curvature decay on non-compact manifolds linked at infinity.
problem Understanding scalar curvature decay on non-compact manifolds with topological linking at infinity.
method Analyzing polynomial decay, developing obstruction theory, using μ μ μ --bubble exhaustions, and index theory. result Topological linking at infinity forces polynomial decay of scalar curvature on manifolds of weakly bounded geometry.
Study on massless Vlasov equation on Reissner-Nordström spacetimes, showing decay rates and non-decay phenomena.
problem Analyzing decay and non-decay rates of solutions to the massless Vlasov equation on Reissner-Nordström spacetimes.
method Quantitative analysis of geodesic flow and comparison to wave equation instability results.
result Exponential decay rates in subextremal cases and polynomial rates in extremal cases, with non-decay of transversal derivatives in extremal cases.
Introduces gradient decay in Softmax for better generalization.
problem Improving generalization performance in neural networks.
method Gradient decay hyperparameter in Softmax for varying gradient rates based on probability.
result Gradient decay rate affects generalization performance and can be tuned for better optimization.
New analysis of SGD with MCMC gradient estimator shows convergence rate and saddle point escape.
problem Analyzing SGD with MCMC gradient estimator under complex conditions.
method Introduced MCMC-SGD, analyzed convergence rate and saddle point escape using Bernstein inequality.
result Proven first order convergence rate O ( log K / n K ) O(\log K/\sqrt{n K}) O ( log K / n K ) and saddle point escape at least O ( ε − 11 / 2 log 2 ( 1 / ε ) ) O(ε^{-11/2}\log^{2}(1/ε) ) O ( ε − 11/2 log 2 ( 1/ ε )) steps. Study examines wave equation decay and Strichartz estimates on conic manifolds.
problem Analyzing wave equation behavior on conic spaces with critical electromagnetic potentials.
method Established decay and Strichartz estimates through localized spectral measure construction.
result Extended and improved previous results on wave equation behavior with critical potentials.
Maxwell equations decay to Coulomb solutions on black hole spacetimes.
problem Decay of Maxwell solutions in Schwarzschild-de Sitter spacetimes.
method Differential transformation of Maxwell tensor components, Fackerell-Ipser equation, vector field method.
result Super-polynomial decay rate of Maxwell solutions to Coulomb solutions.
Weight decay stabilizes training dynamics by slowing progressive sharpening.
problem Understanding how weight decay affects training stability in deep learning models.
method Analyzing weight decay effects at the Edge of Stability, developing a mathematical framework.
result Weight decay dampens oscillations and stabilizes sharpness in CNNs, causing a phase transition in MLPs.
Three mechanisms of weight decay found for different optimizers and architectures.
problem Understanding the regularization effect of weight decay in neural networks.
method Empirical investigation of weight decay for SGD, Adam, and K-FAC with various network architectures.
result Identified three distinct mechanisms of weight decay effect.
Random walks on hyperbolic spaces show linear progress with exponential decay.
problem Understanding progress and decay in random walks on hyperbolic spaces.
method Analyzing random walks on separable, geodesic hyperbolic metric spaces with specific step distributions.
result Exponential decay in progress is extended to non-acylindrical actions.