Develops asymptotic analysis for RandNLA sampling estimators in least-squares problems.
problem Lack of distributional information for RandNLA estimators in statistical inference.
method Asymptotic analysis of sampling estimators for least-squares problems in two settings.
result Sampling estimators are asymptotically normally distributed under mild conditions.
Researchers extend asymptotic analysis to Bergman projections with Gevrey weights.
problem Analyzing Bergman projections with Gevrey weights.
method Extending direct approach to semiclassical asymptotics to Gevrey weights using Fourier integral operators.
result Gevrey symbol amplitude of asymptotic Bergman projection with Gevrey weights and Gevrey-type growth rate.
Projective geometry aids in analyzing fields near compact manifolds.
problem Analyzing fields near compact manifolds.
method Developed a projective exterior differential tractor calculus.
result Analogous calculus for projectively compact manifolds.
Optimizes diversification in catastrophe risk pooling using asymptotic analysis.
problem Maximizing diversification benefit from catastrophic events in insurance pools.
method Asymptotic analysis to solve high-dimensional optimization problem.
result Derives an asymptotically optimal pool that approximates practical optimal pool.
CD algorithm achieves near-optimal convergence rate for unnormalized models.
problem Training unnormalized models with high efficiency.
method Non-asymptotic analysis of contrastive divergence algorithm.
result CD can achieve O(n−1/2) convergence rate under regularity assumptions. Study examines solutions to Jang equation on anti-de Sitter spacetimes.
problem Existence and properties of solutions to the generalized Jang equation.
method Rigorous analysis in asymptotically anti-de Sitter setting.
result Provides solutions for a broad class of asymptotic conditions.
This work analyzes DP-SGD for online LDP problems with practical convergence rates.
problem Analyzing DP-SGD for online LDP problems with practical convergence rates.
method Developed a general framework for online LDP model in stochastic optimization problems, conducted non-asymptotic convergence analysis.
result Comprehensive non-asymptotic convergence analysis of the proposed estimators in finite-sample situations.
The paper analyzes Karcher means on restricted PSD matrices with statistical guarantees.
problem Statistical analysis of non-linear manifolds in machine learning.
method Intrinsic mean model on restricted PSD matrices, Karcher mean analysis, extrinsic signal-plus-noise model.
result Non-asymptotic statistical analysis of Karcher means with deterministic error bounds.
We conduct cluster analysis on a class of locally asymptotically self-similar stochastic processes, which includes multifractional Brownian motion as a representative. When the true number of clusters is supposed to be known, a new covariance-based dissimilarity measure is introduced, from which we obtain the approxima…
This study analyzes LTS in sparse models with finite sample error bounds.
problem Robust regression in high-dimensional sparse models with limited data.
method Non-asymptotic analysis of LTS error bounds.
result Established finite sample error bounds for LTS in sparse models.
Algorithm improves online canonical correlation analysis.
problem Online canonical correlation analysis.
method Stochastic Scaled-Gradient Descent (SSGD) for minimizing expectation over Riemannian manifolds.
result Achieved optimal one-time-scale algorithm with explicit rate of local asymptotic convergence.
We review the spectral analysis and the time-dependent approach of scattering theory for manifolds with asymptotically cylindrical ends. For the spectral analysis, higher order resolvent estimates are obtained via Mourre theory for both short-range and long-range behaviors of the metric and the perturbation at infinity…
Study shows robust method for estimating density ratios even with heavy contamination.
problem Estimating density ratios in the presence of heavy contamination.
method Weighted density ratio estimation (DRE) with doubly strong robustness.
result Weighted DRE achieves sparse consistency under heavy contamination.
The paper analyzes an ensemble of randomly projected linear discriminants for high-dimensional data.
problem Classification issues in small samples of high-dimensional data.
method Asymptotic analysis using random matrix theory.
result The ensemble offers a performance advantage under certain conditions.
Novel approach for large genus intersection number asymptotics.
problem Computing intersection numbers in large genus.
method Resurgent analysis of n-point functions with quantum curve.
result Extension of Aggarwal's results and new r-spin and Theta-class intersection numbers. In this paper, we obtain sharp asymptotic formulas with error estimates for the Mellin convolution of functions, and use these formulas to characterize the asymptotic behavior of marginal distribution densities of stock price processes in mixed stochastic models. Special examples of mixed models are jump-diffusion mode…
Asymptotic analysis of short-maturity options on realized variance in local-stochastic volatility models.
problem Analyzing the behavior of short-maturity options on realized variance in local-stochastic volatility models.
method Large deviations theory and variational problems to solve rate functions for different cases.
result Explicit solutions for the rate function in the uncorrelated case and upper/lower bounds and expansions for the correlated case.
This paper provides an analysis of the tradeoff between asymptotic bias (suboptimality with unlimited data) and overfitting (additional suboptimality due to limited data) in the context of reinforcement learning with partial observability. Our theoretical analysis formally characterizes that while potentially increasin…
Geodesic X-ray transform proves injective for smooth one-forms on gas giant manifolds.
problem Injectivity of geodesic X-ray transform for one-forms on specific manifolds.
method Pestov identity and asymptotic analysis of short geodesics.
result Geodesic X-ray transform is solenoidally injective for smooth one-forms on gas giant manifolds.
Study of asymptotics of meromorphic 3D-index as q approaches 1.
problem Understanding the asymptotic behavior of a meromorphic function related to 3D-index.
method Developed a conjectural asymptotic approximation using stationary phase analysis of a circle-valued angle structure integral.
result Found connections to angle structures and volume optimization.
Independent component analysis (ICA) has been widely used for blind source separation in many fields such as brain imaging analysis, signal processing and telecommunication. Many statistical techniques based on M-estimates have been proposed for estimating the mixing matrix. Recently, several nonparametric methods have…
Novel approach to wave equations near null infinity in flat spacetimes.
problem Analyzing regularity and decay of wave equations near null infinity in asymptotically flat spacetimes.
method Microlocal analysis in a compactified spacetime with corners, focusing on edge-type wave operators.
result Microlocal regularity propagates across null infinity via radial sets, leading to new estimates for wave equations.
New algorithm achieves near optimal sample complexity for 1-identification problem.
problem Determining if an arm's mean reward is at least a known threshold with high probability.
method Design of Sequential-Exploration-Exploitation (SEE) algorithm with non-asymptotic analysis.
result Achieves near optimality in sample complexity, matching upper and lower bounds up to a polynomial logarithmic factor.
A new DML method for continuous treatments uncovers causal mediation effects.
problem Estimating causal mediation effects with continuous treatments.
method Double machine learning (DML) algorithm using kernel-based doubly robust moment function.
result Asymptotic normality with nonparametric convergence rate for estimating mediated response curve.
Study asymptotics of one part monotone Hurwitz numbers in high genus.
problem Asymptotic analysis of one part monotone Hurwitz numbers in high genus.
method Used a linear recurrence and a recent method to extract asymptotics.
result Obtained bivariate asymptotics for one part monotone Hurwitz numbers in high genus.
This paper investigates asymptotic behaviors of gradient descent algorithms (particularly accelerated gradient descent and stochastic gradient descent) in the context of stochastic optimization arising in statistics and machine learning where objective functions are estimated from available data. We show that these alg…
Improved analysis for fair federated learning reduces dependence on noise floor.
problem Asymptotic stationarity in group fair federated learning with reduced noise floor dependence.
method DS FedProxGrad framework with inexact local proximal solutions and fairness regularization.
result Algorithm converges asymptotically to stationarity without dependence on a noise floor.
In this paper we describe a new method for analyzing the Laplacian on asymptotically hyperbolic spaces, which was introduced recently by the author. This new method in particular constructs the analytic continuation of the resolvent for even metrics (in the sense of Guillarmou), and gives high energy estimates in strip…
The purpose of this paper is to provide a sharp analysis on the asymptotic behavior of the Durbin-Watson statistic. We focus our attention on the first-order autoregressive process where the driven noise is also given by a first-order autoregressive process. We establish the almost sure convergence and the asymptotic n…
The paper analyzes the excess risk of PCA and provides a precise characterization.
problem Understanding the excess risk of principal component analysis (PCA).
method Established a central limit theorem for PCA error and derived the excess risk distribution.
result Obtained a non-asymptotic upper bound on the excess risk of PCA.
Study the Bochner-Schrödinger operator on symplectic manifolds, proving gap existence and asymptotic kernel behavior.
problem Analyzing the spectrum and asymptotic behavior of the Bochner-Schrödinger operator on symplectic manifolds.
method Rough asymptotic description, existence proof, off-diagonal exponential estimate, complete asymptotic expansion.
result Existence of gaps in the spectrum and asymptotic kernel behavior.
This paper analyzes hedge errors in Black-Scholes models using finite difference techniques.
problem Accurate hedging strategies in dynamic market environments.
method Asymptotic approach and finite difference techniques.
result Reduction of hedge errors and enhancement of option pricing model robustness.
Theoretical analysis improves understanding of Deep Q-Learning's behavior.
problem Lack of formal guarantees and gaps between theory and practice of Deep Q-Learning.
method Dynamical systems perspective, focusing on realistic assumptions.
result Proves convergence of Deep Q-Learning under specific conditions.
Refines geometric center of mass analysis for Einstein field equations.
problem Analyzing the geometric center of mass of Willmore surfaces in initial data for Einstein field equations.
method Refined Lyapunov-Schmidt analysis to study geometric center of mass of area-constrained Willmore surfaces.
result The geometric center of mass agrees with the Hamiltonian center of mass under specific conditions.
We study sparse principal component analysis for high dimensional vector autoregressive time series under a doubly asymptotic framework, which allows the dimension d to scale with the series length T. We treat the transition matrix of time series as a nuisance parameter and directly apply sparse principal component…
Study on discrete Okounkov bodies and their applications.
problem Understanding stability and thresholds in higher dimensions.
method Analysis of discrete Okounkov bodies and gap phenomena.
result Asymptotic analysis of stability and thresholds.
New IRL algorithm identifies optimal reward and policy from expert demonstrations.
problem Understanding reward functions from expert demonstrations with neural networks.
method Two-timescale single-loop IRL algorithm for neural network parameterized rewards.
result First IRL algorithm with non-asymptotic convergence guarantee and global optimality in neural network settings.
UCB-V algorithm improves on UCB for MAB problems with variance estimates.
problem Optimizing arm selection in MAB problems with variance information.
method Asymptotic and high probability analysis of UCB-V algorithm.
result UCB-V can exhibit instability in arm-pulling rates but achieves refined regret bounds.
Authors improve accuracy analysis for portfolio optimization with multiple timescale factors.
problem Asymptotic accuracy of portfolio optimization approximations for general utility functions and two timescale factors.
method Construct sub- and super-solutions to fully nonlinear problem.
result Rigorous justification of accuracy for portfolio optimization with general utility functions and two timescale factors.
Study non-asymptotic BPI guarantees for online RL.
problem Identify optimal policy in MDP with high confidence.
method Non-asymptotic sample complexity guarantees for NaS algorithm.
result Sample complexity depends on MDP connectivity and curvature.
New method shows Hessian estimator from random samples converges to true Hessian on complex manifolds.
problem Uncertainty in Hessian estimator accuracy on complex manifolds with boundaries and nonuniform sampling.
method Locally fitting quadratic polynomials, rigorous theoretical analysis under mild conditions.
result The Hessian estimator asymptotically converges to the true Hessian, even near boundaries.
The paper proves isoperimetric regions on Riemannian manifolds with Ricci bounded below.
problem Proving the existence of isoperimetric regions in Riemannian manifolds.
method Gromov-Hausdorff asymptotic analysis to study perimeter-minimizing sequences.
result Existence of isoperimetric regions in noncollapsed Riemannian manifolds with Ricci curvature bound.
SLOPE is a relatively new convex optimization procedure for high-dimensional linear regression via the sorted l1 penalty: the larger the rank of the fitted coefficient, the larger the penalty. This non-separable penalty renders many existing techniques invalid or inconclusive in analyzing the SLOPE solution. In this pa…
The question of the optimality of Thompson Sampling for solving the stochastic multi-armed bandit problem had been open since 1933. In this paper we answer it positively for the case of Bernoulli rewards by providing the first finite-time analysis that matches the asymptotic rate given in the Lai and Robbins lower boun…
Extends JKO scheme for iterative algorithms with unknown parameters.
problem Computational and statistical analysis of iterative algorithms with unknown parameters.
method Develops statistical methods to estimate unknown parameters and adapts JKO scheme.
result Establishes asymptotic theory for the statistical JKO scheme.
Ancient pancake solutions found for curvature flows.
problem Finding unique ancient solutions to curvature flows.
method Constructing and analyzing O(1)imesO(n)-invariant ancient solutions. result Unique O(n)-invariant ancient solutions found. Study curvature and torsion from cross-ratios in discrete curves.
problem Define curvature and torsion for discrete curves using cross-ratios.
method Use Möbius invariant point-insertion-rule to construct circles and express torsion using cross-ratio.
result Discrete curvature and torsion defined using cross-ratios converge to smooth curvature and torsion as sampling density increases.
New algorithm reduces sample complexity for Top Two method.
problem Fixed-confidence best arm identification for Top Two methods.
method UCB-based Top Two algorithm for non-asymptotic analysis.
result First non-asymptotic upper bound on expected sample complexity.