New method for spectral and Bergman kernels under local spectral gap condition.
problem Analyzing spectral and Bergman kernels for complex manifolds.
method Developed a new scaling method to study spectral and Bergman kernels.
result Established pointwise asymptotics of spectral and Bergman kernels.
The spectral k-support norm enjoys good estimation properties in low rank matrix learning problems, empirically outperforming the trace norm. Its unit ball is the convex hull of rank k matrices with unit Frobenius norm. In this paper we generalize the norm to the spectral (k,p)-support norm, whose additional para…
New bounds for KRR condition number reveal overfitting phenomena.
problem Characterizing overfitting in KRR with varying kernel spectral decay.
method Derived new bounds for kernel matrices, enhanced test error bounds, and identified feature independence role.
result Identified tempered and catastrophic overfitting phenomena.
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.
Improved performance of factorized neural layers through spectral initialization and Frobenius decay.
problem Improving the performance of factorized neural layers in various deep learning contexts.
method Spectral initialization and Frobenius decay for initialization and regularization.
result Spectral initialization and Frobenius decay lead to improved performance across multiple deep learning settings.
Spectral feature learning improves IV regression for causal effect estimation.
problem Estimating causal effects in the presence of hidden confounders.
method Two-stage least squares estimator based on spectral features.
result Performance of the method depends on strong spectral alignment and slow eigenvalue decay.
Study shows rapid decay of Hitchin metric from semi-flat metric on Higgs bundles.
problem Analyzing the asymptotic behavior of the Hitchin metric on moduli spaces of Higgs bundles.
method Examined the decay rate of the difference between Hitchin and semi-flat metrics on smooth spectral curves.
result Exponential decay of the difference between Hitchin and semi-flat metrics as t approaches infinity.
Global stability proved for Navier-Stokes equations on hyperbolic space.
problem Stability of the Navier-Stokes equations on hyperbolic space.
method Proved global stability with exponential decay rate for small initial data.
result Exponential decay rate of $μλ_\Def^{(3)}$ for Navier-Stokes equations on hyperbolic space.
Spectral flow connects manifold geometry to rigidity criteria.
problem Tackling rigidity of simply-connected closed manifolds.
method Spectral deformation flow and invariant-based approach.
result Spherical profile is the unique manifold-compatible asymptotic realization.
We prove exponential decay of correlations for Hölder continuous observables with respect to any Gibbs measure for contact Anosov flows admitting Pesin sets with exponentially small tails. This is achieved by establishing strong spectral estimates for certain Ruelle transfer operators for such flows.
Study improves the exponential rate of metric difference in Higgs bundles.
problem Improving the exponential rate of metric difference in Higgs bundles.
method Analyzes the Hitchin metric and semi-flat metric in rank two Higgs bundles.
result Exponential rate of metric difference is improved.
Unified analysis of kernel-based and locally adaptive bandit optimization methods.
problem Performance of bandit optimization algorithms in RKHS functions.
method Investigates the relationship between kernel regularity and algorithmic performance, characterizing spectral properties of various kernels.
result Unified framework for analyzing kernel-based and locally adaptive bandit algorithms, deriving explicit regret bounds.
The study improves norms of spectral projectors on specific surfaces.
problem Improving the L2oL∞ norm of spectral projectors on certain surfaces. method Quantum Integrability, joint basis of eigenfunctions, Lagrangian oscillatory functions, caustics, BKW decay.
result Polynomial improvement on the L2oL∞ norm for generic simple spheres of revolution and the Euclidean disk. S2D selectively decays large singular values to improve quantization of neural activations.
problem Large activation outliers in transformer models cause accuracy drops during quantization.
method Selective Spectral Decay (S2D) that surgically regularizes only the largest singular values. result Significantly reduces activation outliers and produces well-conditioned representations.
Study on variance of Laplace eigenfunctions on manifolds.
problem Investigating the variance of Laplace eigenfunctions on compact manifolds.
method Combining Kac-Rice formula, Wiener-Itô chaos decompositions, and pointwise Weyl law analysis.
result Established a quantitative bound for the fluctuations of nodal volumes, improving existing results.
Estimates kernel eigenvalues for compositional dot-product kernels.
problem Improving estimates for kernel eigenvalues.
method Eigenvalue decay estimates of integral operators associated with dot-product kernels.
result Improved estimates for kernel volumes in reproducing kernel Hilbert spaces.
New Hermite approximations accelerate convergence with adaptive coordinate transformations.
problem Accelerating convergence of spectral approximations for Hermite expansions.
method Using normalizing flows for adaptive coordinate transformations and deriving error estimates.
result Error estimates for Hermite expansions under adaptive coordinate transformations.
On curved spaces, viscous fluids reach equilibrium quickly.
problem Thermalization of viscous fluids on negatively curved manifolds.
method Stochastic Navier-Stokes equations with kinematically selected deformation Laplacian.
result Exponential thermalization rate of $2νλ_\Def$.
Study tackles distribution shift in combinatorial settings using matrix completion techniques.
problem Tackling distribution shift in combinatorial settings with rigorous statistical guarantees.
method Develops novel algorithms and theoretical results for extrapolating to test distributions not covered in training.
result Achieves bilinear combinatorial extrapolation under gradual spectral decay in high-dimensional data.
We study the spectral gap of the Erdős--Rényi random graph through the connectivity threshold. In particular, we show that for any fixed δ>0 if p≥n(1/2+δ)logn, then the normalized graph Laplacian of an Erdős--Rényi graph has all of its nonzero eigenvalues tightly concentrated around 1. We est…
LASE improves local network structure visualization by targeting locally low-dimensional regions.
problem Global spectral embedding fails to capture local geometric features in sparse, transitive networks.
method Local Adjacency Spectral Embedding (LASE) using weighted spectral decomposition.
result LASE reveals locally low-dimensional structure, improving local reconstruction and visualization.
New methods improve tree ensemble models by compressing them while maintaining accuracy.
problem Theoretical understanding and practical compression of tree ensembles like random forests and gradient boosting machines.
method Spectral perspective on tree ensembles, deriving minimax rates and developing compression schemes.
result Leading eigenfunctions/singular vectors capture dominant predictive directions, leading to smaller, competitive models.
The concern of this paper is to clarify a relationship between the curvatures at infinity and the spectral structure of the Laplacian. In particular, this paper discusses the question of whether there is an eigenvalue of the Laplacian embedded in the essential spectrum or not. The borderline-behavior of the radial curv…
We study the distribution of resonances for geometrically finite hyperbolic surfaces of infinite area by countting resonances numerically. The resonances are computed as zeros of the Selberg zeta function, using an algorithm for computation of the zeta function for Schottky groups. Our particular focus is on three aspe…
Muon optimizer improves deep learning with spectral norm constraints.
problem Improving optimization algorithms in deep learning.
method Theoretical analysis of Muon optimizer within the Lion-K family. result Muon implicitly solves an optimization problem enforcing spectral norm constraints.
Fiedler regularization uses spectral graph theory to improve neural network performance.
problem Improving neural network performance by penalizing weights based on connectivity.
method Uses the Fiedler value of the neural network's graph as a regularization tool, providing theoretical and computational methods.
result Demonstrates Fiedler regularization's effectiveness in improving neural network performance.
Unified framework explains why overfitting is benign in interpolating learning.
problem Understanding why overfitting is benign in highly overparameterized models.
method Spectral-transport stability framework.
result Sharp benign-overfitting criterion and explicit phase-transition rates.
A new flow method reduces Lorentz contraction to a simple algebraic decay.
problem Reducing Lorentz contraction in geometric models.
method Variational scalar conformal flow with algebraic decay.
result Explicit algebraic decay law for energy functional.
Method detects neural network equivalence via matrix ensembles and spectral analysis.
problem Detecting equivalence among different deep learning architectures.
method Generating Mixed Matrix Ensembles (MMEs) and matching to conjugate circular ensembles.
result Empirical evidence shows vanishing differences in spectral densities with long tail decay rates.
New optimizer SF-NorMuon matches tuned AdamW across various horizons.
problem Fixed learning-rate schedules in neural network training lead to strong path dependence and costly re-tuning.
method Schedule-Free Spectral Optimization (SF-NorMuon)
result SF-NorMuon outperforms tuned AdamW on 125M and 772M parameter models across different horizons.
New compression methods handle biased input sequences for more accurate posterior summaries.
problem Handling biased input sequences for accurate posterior summaries.
method Stein kernel thinning, low-rank SKT, Stein recombination, Stein Cholesky.
result Achieves accurate posterior summaries with biased input sequences.
We introduce a novel algorithm that computes the k-sparse principal component of a positive semidefinite matrix A. Our algorithm is combinatorial and operates by examining a discrete set of special vectors lying in a low-dimensional eigen-subspace of A. We obtain provable approximation guarantees that depend on t…
Community detection in hypergraphs is explored. Under a generative hypergraph model called "d-wise hypergraph stochastic block model" (d-hSBM) which naturally extends the Stochastic Block Model from graphs to d-uniform hypergraphs, the asymptotic minimax mismatch ratio is characterized. For proving the achievability, w…
New analysis shows SNG's effectiveness in small samples.
problem Limited understanding of SNG in small data settings.
method Sketch-and-project analysis of SNG.
result Global convergence and rate characterization for SNG.
Power-law spectrum of random feature model is preserved in neural networks.
problem Preserving power-law spectrum in neural networks through random feature model.
method Characterized eigenvalues of population random-feature covariance using dyadic head-tail decomposition and Wick chaos expansions.
result Power-law exponent α is inherited from input covariance, modified by a logarithmic correction. Jets from boosted heavy particles have a typical angular scale which can be used to distinguish them from QCD jets. We introduce a machine learning strategy for jet substructure analysis using a spectral function on the angular scale. The angular spectrum allows us to scan energy deposits over the angle between a pair …
Generative Adversarial Networks (GANs), though powerful, is hard to train. Several recent works (brock2016neural,miyato2018spectral) suggest that controlling the spectra of weight matrices in the discriminator can significantly improve the training of GANs. Motivated by their discovery, we propose a new framework for t…
Study uncovers scaling laws and spectral properties of shallow neural networks.
problem Understanding scaling laws and spectral properties of shallow neural networks.
method Leveraging connections with matrix compressed sensing and LASSO, derived a phase diagram for excess risk.
result Uncovered crossovers between scaling regimes and plateau behaviors, validated empirical observations.
The salient properties of large empirical covariance and correlation matrices are studied for three datasets of size 54, 55 and 330. The covariance is defined as a simple cross product of the returns, with weights that decay logarithmically slowly. The key general properties of the covariance matrices are the following…
We consider the problem of clustering datasets in the presence of arbitrary outliers. Traditional clustering algorithms such as k-means and spectral clustering are known to perform poorly for datasets contaminated with even a small number of outliers. In this paper, we develop a provably robust spectral clustering algo…
We prove an existence result for the Poisson equation on non-compact Riemannian manifolds satisfying weighted Poincaré inequalities outside compact sets. Our result applies to a large class of manifolds including, for instance, all non-parabolic manifolds with minimal positive Green's function vanishing at infinity. On…
Positive weights improve kernel quadrature's accuracy.
problem Improving kernel quadrature weights to be positive and stable.
method Using convex geometry to approximate the kernel mean embedding with positive weights.
result Positive weights lead to improved kernel quadrature bounds with Monte-Carlo-beating rates.
The energy in a square membrane Ω subject to constant viscous damping on a subset ω⊂Ω decays exponentially in time as soon as ω satisfies a geometrical condition known as the "Bardos-Lebeau-Rauch" condition. The rate τ(ω) of this decay satisfies τ(ω)=2min(−μ(ω),g(ω)) (see Lebeau [Math. Phys. Stud. …
GenMod uses generative models to approximate high-dimensional PDE solutions with limited evaluations.
problem Quantifying uncertainty in high-dimensional PDE systems with random parameters.
method Develops a method using generative models to approximate polynomial chaos coefficients in underdetermined systems.
result The method outperforms sparsity-promoting methods in approximating PDE solutions with limited evaluations.
Bayesian framework for sphere regression using Gaussian fields.
problem Nonparametric regression on the sphere with Gaussian priors.
method Isotropic Gaussian field priors, harmonic structure, exact posterior distributions, optimal spectral truncation, posterior contraction rates.
result Sharp posterior contraction rates for Gaussian priors with polynomially decaying angular power spectra.
New gauge preserves Einstein metrics' interactions, proving rigidity on negatively curved manifolds.
problem Stability and deformation theory of Einstein metrics.
method Introduces Chen-Nagano gauge condition, linking Lichnerowicz Laplacian to shifted scalar operator.
result Chen-Nagano gauge collapses to classical transverse-traceless gauge under spectral pinching assumptions.
Persistence diagrams from random matrices follow RMT universality, offering a new spectral diagnostic.
problem Understanding spectral properties of random matrices using topological data analysis.
method Applying Morse theory to persistence diagrams of quadratic forms restricted to unit spheres.
result Persistence entropy outperforms traditional level spacing ratios in discriminating random matrix ensembles.
Improved model for non-smooth signals with complex spectra.
problem Current models struggle with non-smooth signals and complex spectral structures.
method CGPCM and RGPCM models with causality and Bayesian nonparametric interpretations, improved variational inference.
result Proposed models show better performance on synthetic and real-world data.