Introduces resemblance structure for large scale geometry.
problem Defining similarity in large scale geometry.
method Axiomatizing the concept of resemblance for subsets of a set.
result Large scale resemblance structures can induce nearness and generalize large scale properties.
Minimal surfaces with negative curvature found in large spheres.
problem Existence of minimal surfaces with negative curvature in large dimensional spheres.
method Applied Song's strategy to closed Riemann surfaces with large automorphism groups, resulting in almost hyperbolic minimal surfaces.
result Existence of closed minimal surfaces with negative induced curvature in any sphere of large dimension.
A new law of large numbers for single catastrophic risks.
problem Insurance risks from a single catastrophic event.
method Large diversification effect through optimal allocation to many reinsurers or investors.
result Derives a strong law of large numbers for insurance risks.
Ranky solves SVD for large sparse matrices in distributed systems.
problem Rank problem in large sparse matrices for SVD.
method Distributed approach to solve rank problem.
result Recovers SVD with negligible error for large sparse matrices.
Study shows HFT benefits large traders under certain conditions.
problem Influence of high-frequency traders (HFTs) on large traders.
method Analyzes the impact of HFT front-running on large traders under different conditions.
result HFT benefits large traders when there is high-speed noise trading and vague HFT predictions.
Study large deviations in life insurance portfolios without identical distributions.
problem Large deviations in life insurance portfolios with bounded losses and variances.
method Upper bound from standard large deviations, counterexample for full large deviation principle.
result Exponential bound for average loss exceeding a threshold.
Large knots have very varied boundary slopes.
problem Understanding the variability of boundary slopes in knots.
method Analyzing alternating knots and their boundary slopes.
result The ratio of boundary slope diameter to crossing number can be arbitrarily large.
Study minimizes large losses in financial portfolios.
problem Minimizing large losses in financial portfolios.
method Generalizes quantile hedging approach for discrete and continuous time models.
result Generalized approach for minimizing large losses.
Large batch training improves deep learning performance without needing warmup.
problem Slow convergence at early epochs in large batch training.
method Proposes CLARS algorithm and analyzes convergence rate.
result Proposed algorithm outperforms gradual warmup and state-of-the-art large-batch optimizers.
IVON optimizes large neural networks, matching or outperforming Adam.
problem The inefficacy of variational learning in large neural networks.
method Improved Variational Online Newton (IVON) optimizer.
result IVON consistently matches or outperforms Adam for large networks.
An extra large metric is a spherical cone metric with all cone angles greater than 2 pi and every closed geodesic longer than 2pi. We show that every two-dimensional extra large metric can be triangulated with vertices at cone points only. The argument implies the same result for Euclidean and hyperbolic cone metrics, …
Large deviations for fat tailed distributions, i.e. those that decay slower than exponential, are not only relatively likely, but they also occur in a rather peculiar way where a finite fraction of the whole sample deviation is concentrated on a single variable. The regime of large deviations is separated from the regi…
Study large deviations for hypoelliptic diffusion on sub-Riemannian manifolds.
problem Large deviations for hypoelliptic diffusion measures on sub-Riemannian manifolds.
method Rough path theory and manifold-valued Malliavin calculus.
result Proved a large deviation principle for pinned hypoelliptic diffusion measures.
Extends saddle-point method for large-time volatility smiles.
problem Analyzing large-time volatility smiles in financial models.
method Saddle-point approach to derive large-time model-implied volatility smiles.
result Provides theoretical foundation and wide class of arbitrage-free parametrizations.
SNGM improves large-batch training accuracy.
problem Improving generalization in large-batch training.
method Stochastic Normalized Gradient Descent with Momentum.
result SNGM achieves better test accuracy than MSGD and other large-batch methods.
GD with large init shows incremental learning in matrix factorization.
problem Understanding GD's behavior with large initial values in matrix factorization.
method Signal-to-noise ratio concepts and inductive arguments.
result Uncovering an incremental learning phenomenon in GD with large initialization.
DReg boosts large-batch SGD's generalization and convergence.
problem Large-batch SGD struggles with generalization in deep learning.
method DReg replicates a layer to encourage parameter diversity.
result DReg improves generalization and convergence with large-batch SGD.
Paper proves large deviation principle for stochastic approximations.
problem Asymptotic estimates of learning algorithm deviations.
method Weak convergence approach to large deviations.
result Identifies appropriate scaling sequence and new representation for rate function.
Study the large scale geometry of homeomorphism groups of compact manifolds.
problem Understanding the large scale geometry of homeomorphism groups of compact manifolds.
method Show the quasi-isometry type of the identity component of homeomorphism groups and study its large scale geometry.
result Relate the large scale geometry to the topology of M and dynamics of group actions on M.
As it is known in the finance risk and macroeconomics literature, risk-sharing in large portfolios may increase the probability of creation of default clusters and of systemic risk. We review recent developments on mathematical and computational tools for the quantification of such phenomena. Limiting analysis such as …
Study shows how large neural networks avoid overfitting through decoupling of feature learning and complexity growth.
problem Understanding inductive bias and generalization in large neural networks.
method Dynamical mean field theory applied to large two-layer networks.
result Training dynamics of large networks exhibit a separation of timescales, decoupling feature learning and overfitting.
Study rolling dynamics with random slipping and twisting using large deviation principles.
problem Analyzing the stability of a rolling model with random slipping and twisting.
method Modelled as a stochastic differential equation on the orthonormal frame bundle, examined via large deviations.
result Proved large deviation principles for projection curves and their horizontal lifts on the base manifold.
Hierarchical Softmax approximates class probabilities for large datasets efficiently.
problem Computational inefficiency of Softmax for large-scale classification tasks.
method Used Hierarchical Softmax to approximate class probabilities efficiently.
result Hierarchical Softmax performance degrades as the number of classes increases.
We study large deviations and rare default clustering events in a dynamic large heterogeneous portfolio of interconnected components. Defaults come as Poisson events and the default intensities of the different components in the system interact through the empirical default rate and via systematic effects that are comm…
The study estimates curvature on graphs with large girth.
problem Estimating curvature on graphs with large girth.
method Utilized CD and CDE inequalities.
result Curvature estimates on finite graphs with large girth.
Large learning rates enhance model robustness and compressibility.
problem Achieving robustness and resource-efficiency in machine learning models.
method Identifying and utilizing large learning rates as a facilitator for robustness and compressibility.
result Large learning rates produce desirable representation properties and compare favorably to other methods.
Large traders disrupt the market's long-term memory of order signs.
problem Long-term memory of market order signs is weakened by large traders.
method Analyzed over 6.7 billion trades to investigate the impact of large investment funds on market order dynamics.
result The long-term memory of market order signs is weaker when large investment funds trade in a directional manner and when their participation is high.
Study large deviations in random walks on Lie groups.
problem Large deviations in sub-Riemannian random walks.
method Prove large deviation principle for random walks on stratified Lie groups.
result Proved a large deviation principle with a rate function adapted to sub-Riemannian geometry.
We study the concept of coarse disjointness and large scale n-to-1 functions. As a byproduct, we obtain an Ostrand-type characterization of asymptotic dimension for coarse structures. It is shown that properties like finite asymptotic dimension, coarse finitism, large scale weak paracompactness, ect. are all invari…
Study on implied volatility of an affine jump-diffusion model.
problem Characterize implied volatility of an affine jump-diffusion model.
method Explicit moment generating function derived from solving ODEs; large deviation principle applied.
result Asymptotic behaviors of implied volatility in large-maturity and large-strike regimes characterized.
Study large deviations in fractional volatility models with non-Gaussian volatility.
problem Large deviations in fractional volatility models with non-Gaussian volatility.
method Established a small-noise large deviation principle for log-price.
result Logarithmic call price asymptotics for large strikes in a special case.
In these notes, we present some methods and applications of large deviations to finance and insurance. We begin with the classical ruin problem related to the Cramer's theorem and give en extension to an insurance model with investment in stock market. We then describe how large deviation approximation and importance s…
GNTK reveals convergence of GNNs on large graphs.
problem Understanding and optimizing GNNs on large graphs.
method Graph Neural Tangent Kernels (GNTK) and graphons.
result GNTKs converge to graphon NTKs on large graphs, enabling task inference.
New method for clustering large multi-view data.
problem Handling large multi-view data efficiently.
method Incremental minimax optimization based fuzzy clustering (IminimaxFCM).
result IminimaxFCM outperforms related methods in clustering accuracy.
Paper presents an efficient algorithm for learning minimax risk classifiers with large-scale data.
problem Efficient learning of minimax risk classifiers for large-scale data with multiple classes.
method Combination of constraint and column generation for efficient learning.
result 10x speedup for general large-scale data and 100x speedup with many classes.
Wider neural networks perform better with large batches.
problem Communication overheads in small-batch training.
method Theoretical analysis and experiments on neural networks.
result Wider networks are more suitable for large-batch training.
A faster method for visualization recommendations on large datasets.
problem Infeasibility of state-of-the-art vis-rec models on large datasets due to high computational time.
method Reinforcement-learning (RL) framework that identifies optimal statistics within a time budget.
result Significantly reduces time-to-visualize with minimal error compared to baseline approaches.
Optimizes variance reduction in Heston model using large and moderate deviations.
problem Improving variance reduction in stochastic volatility models.
method Large and moderate deviations theory applied to Heston model.
result Derives closed-form solutions for optimal change of measure.
Paper introduces scalable clustering for large datasets with outliers.
problem Lack of scalable algorithms for large datasets with outliers.
method Provable robust clustering algorithm based on loss minimization for Gaussian mixture models.
result Algorithm provides high accuracy with theoretical guarantees and outperforms existing methods.
Let G be a finitely presented group, and let p be a prime. Then G is 'large' (respectively, 'p-large') if some normal subgroup with finite index (respectively, index a power of p) admits a non-abelian free quotient. This paper provides a variety of new methods for detecting whether G is large or p-large. These relate t…
ISEE method efficiently estimates large precision matrices in Gaussian graphical models.
problem Estimating large precision matrices in ultra-large Gaussian graphical models.
method ISEE method combines sparse modeling and large covariance matrix estimation.
result ISEE method can recover graphical structure with significant probability and efficient estimation of link strengths.
Gradient descent with large momentum finds flatter minima.
problem Understanding the effects of momentum in gradient descent.
method Empirical and theoretical analysis of gradient descent with large momentum.
result Large momentum leads to flatter minima than gradient descent.
Study on frequencies of non-simple curves in surfaces of large genus.
problem Frequency of non-simple curves in surfaces of large genus.
method Expression for frequency, large genus asymptotics, comparison with previous work.
result Identify most common types of non-simple curves with K intersections.
The problem of hedging and pricing sequences of contingent claims in large financial markets is studied. Connection between asymptotic arbitrage and behavior of the α~-~quantile price is shown. The large Black-Scholes model is carefully examined.
Improves few-shot learning by adding a large margin to metric-based methods.
problem Few-shot learning's challenge of generalizing well with limited data.
method Unified framework with large margin distance loss function.
result Significant performance improvement with minimal computational overhead.
Paper establishes comparison theorems for large-margin learning.
problem Data piling issue in high-dimension and low-sample size SVM.
method Large-margin unified machines (LUM) loss functions.
result New comparison theorems for all LUM loss functions.
Large deviations theory applied to policy gradient methods.
problem Understanding convergence of policy gradient methods in reinforcement learning.
method Large deviation rate function and contraction principle from large deviations theory.
result Convergence properties of policy gradient methods can be extended to various policy parametrizations.
Study examines large deviations in random walks on hyperbolic spaces.
problem Large deviations in random walks on Gromov-hyperbolic spaces.
method Established large deviations results for distance and translation length of random walks.
result Deduced a special case of a conjecture regarding spectral radii of random matrix products.