Gradient descent converges linearly for overparameterized linear networks.
problem Convergence of gradient descent for overparameterized neural networks.
method Local Polyak-Lojasiewicz and Descent Lemma for overparameterized linear models.
result Gradient descent achieves linear convergence for two-layer linear networks under relaxed assumptions.
Paper analyzes neural network distances and stability, leading to a new learning rule.
problem Stability and efficiency in training deep neural networks.
method Relational trust distance and descent lemma for neural networks.
result New learning rule requires minimal learning rate tuning.
Paper proves multiplicative weight updates can train neural networks without learning rate tuning.
problem Vanishing and exploding gradients in gradient descent for compositional functions.
method Proves descent lemma for compositional functions using multiplicative weight updates and derives Madam optimizer.
result Madam optimizer trains state-of-the-art neural networks without learning rate tuning.
Develops a generalized version of Chung's Lemma for stochastic optimization methods.
problem Establishing asymptotic convergence rates for stochastic optimization methods under various step size rules.
method Generalized version of Chung's Lemma for a broader family of step size rules.
result Demonstrates tight non-asymptotic convergence rates for various stochastic methods.
New method improves optimization algorithms without Lipschitz smoothness.
problem Improving optimization algorithms in the absence of Lipschitz smoothness.
method Dual kernel conditioning (DKC) to provide dual Lipschitz continuity.
result First complexity bounds and iterate convergence for random reshuffling mirror descent.
We study the projected gradient descent method on low-rank matrix problems with a strongly convex objective. We use the Burer-Monteiro factorization approach to implicitly enforce low-rankness; such factorization introduces non-convexity in the objective. We focus on constraint sets that include both positive semi-defi…
Inexact subgradient methods work well for semialgebraic functions with additive errors.
problem Approximate gradients in machine learning and optimization.
method Inexact subgradient methods with persistent additive errors in semialgebraic functions.
result Iterates eventually fluctuate near the critical set with a proximity of O(ερ), where ε is the magnitude of subgradient evaluation errors. Paper analyzes SVGD algorithm for non-asymptotic convergence.
problem Optimizing a set of particles to approximate a target probability distribution.
method Finite time analysis of SVGD algorithm, providing descent lemma and convergence rates.
result SVGD algorithm decreases the objective at each iteration and converges to the target distribution.
Gradient descent solves robust mean estimation in high dimensions.
problem High-dimensional robust mean estimation in the presence of adversarial outliers.
method Gradient descent with a structural lemma showing near-optimal solutions.
result Gradient descent can solve the robust mean estimation problem directly.
Derandomization reveals structure in neural networks, reducing sample complexity.
problem Understanding feature learning dynamics in neural networks.
method Derandomization lemma applied to arbitrary NNs with any smooth loss function.
result Optimizing function converges to zero weight matrix, revealing structure.
Explains the Schwarz lemma in lecture notes.
problem None explicitly stated; focuses on explanation.
method Expository notes on the Schwarz lemma.
result Explains the Schwarz lemma.
This paper analyzes convergence of RMSProp and Adam in non-convex optimization with tight complexity bounds.
problem Analyzing convergence of RMSProp and Adam in non-convex optimization with relaxed assumptions.
method Developed new convergence analyses for RMSProp and Adam, considering adaptive learning rates and affine noise variance.
result RMSProp and Adam converge to ε-stationary points with iteration complexities of O(ε^(-4)) under proper hyperparameters.
Author provides an alternate proof of the free ribbon lemma.
problem Proving that every free sphere-link in the 4-sphere is a ribbon sphere-link.
method An alternate proof of the free ribbon lemma.
result Provides an alternate proof of the free ribbon lemma.
The paper extends Schwarz's lemma to RC-positivity and complex manifolds.
problem Comparing metrics with RC-positivity in complex manifolds.
method Establishing Schwarz lemmas for RC-positivity and applying them to complex manifolds.
result New diameter and volume comparison theorems.
Survey on strong closing lemmas in Hamiltonian dynamics.
problem Understanding dynamics in Hamiltonian systems.
method Use spectral invariants in symplectic geometry.
result Proofs of strong closing lemmas in various dimensions.
Unified Schwarz lemma in Kähler and Hermitian geometry.
problem Various forms of the Schwarz lemma in Kähler and Hermitian geometry.
method Introducing new curvatures to refine and elucidate the real bisectional curvature.
result Unified Chern-Lu, Aubin-Yau, and Chen-Cheng-Look Schwarz lemmas.
Paper generalizes Schwarz Lemma for VT harmonic maps with conditions.
problem Generalizing Schwarz Lemma for a specific type of harmonic maps.
method Conditions on eigenvalues and Ricci curvature are used to prove the lemma.
result Schwarz Lemma for VT harmonic maps proved with distance and volume decreasing properties.
Formulates Index III lemma and Rauch III theorem with applications.
problem Develops new mathematical theorems based on existing ones.
method Formulation of Index III lemma and Rauch III theorem based on Index I, II lemmas and Rauch I, II theorems.
result Presented Rauch's type theorem and volume comparison result as applications.
New Schwarz Lemma for Bergman metrics in bounded domains.
problem Finding bounds for Bergman metrics in bounded domains.
method Using Cauchy-Schwarz inequality from probability theory.
result Established a new Schwarz Lemma for Bergman metrics.
Tucker and Ky Fan's lemma are combinatorial analogs of the Borsuk-Ulam theorem (BUT). In 1996, Yu. A. Shashkin proved a version of Fan's lemma, which is a combinatorial analog of the odd mapping theorem (OMT). We consider generalizations of these lemmas for BUT-manifolds, i.e. for manifolds that satisfy BUT. Proofs rel…
Paper proves a discrete Schwarz-Pick lemma for generalized circle packings.
problem Comparing geometric quantities of circle packings with different boundary values.
method Combinatorial Calabi flows and maximum principle.
result Discrete Schwarz-Pick lemma proven for generalized circle packings.
The paper improves Zakalyukin's lemma for frontals and applies it to surface singularities.
problem Improving the conditions under which wave front germs imply map germs.
method Generalization of Zakalyukin's lemma for frontals and applications to surface singularities.
result The paper provides a more general version of Zakalyukin's lemma for map germs.
Meridian lemma extended to fully alternating links in thickened surfaces.
problem Extending Menasco's meridian lemma to fully alternating links in thickened surfaces.
method Developed a new meridian lemma for fully alternating links in thickened orientable surfaces of positive genus.
result The meridian lemma holds for fully alternating links in thickened surfaces.
Proves a quantitative closing lemma for negatively curved manifolds.
problem Closing lemma for negatively curved manifolds.
method Quantitative closing lemma proof.
result Study of partner and pseudo-partner orbits for self-crossing closed geodesics.
Paper generalizes Schwarz lemma for harmonic maps between Riemannian manifolds.
problem Generalizing Schwarz lemma for harmonic maps.
method Using Bochner techniques and sub-Laplacian comparison theorem.
result Established a generalization of Schwarz lemma for transversally harmonic maps.
Extends Margulis Lemma to RCD(K,N) spaces.
problem Applying Margulis Lemma to new geometric structures.
method Improved Regularity Estimates for Regular Langrangian Flows.
result Margulis Lemma extended to RCD(K,N) spaces.
For a symplectic manifold (M,ω), not necessarily hard Lefschetz, we prove a version of the Merkulov dδ--lemma. We also study the dδ--lemma and related cohomologies for compact symplectic solvmanifolds.
The paper characterizes when the ∂∂-lemma holds for twistor spaces.
problem Characterizing the ∂∂-lemma for twistor spaces. method Study Bott-Chern and Aeppli cohomologies of twistor spaces.
result Explicit computation of Dolbeault cohomology for flat torus twistor space.
Positive representations on surfaces have positive cross-ratios and satisfy a collar lemma.
problem Characterizing representations of surface groups with positive properties.
method Proving a collar lemma and showing positivity of cross-ratios for Θ-positive representations. result Closed subsets of representation varieties are characterized by Θ-positive representations. Proves a generalized Whitehead cut vertex lemma for tree groups.
problem Extending Whitehead's cut vertex lemma to tree group conjugacy classes.
method Proves a version of Whitehead's lemma for tree groups.
result Establishes a cut vertex in star graphs for tree group conjugacy classes.
Proves a general ∂∂̄-lemma and applies it to a Fujino conjecture.
problem Establishing a general ∂∂̄-lemma and its applications.
method Develops a general ∂∂̄-lemma and applies it to Fujino's conjecture.
result Establishes a Kähler version of Fujino's injectivity theorem.
Enhanced Schwarz lemma for Hermitian manifolds with new curvature constraints.
problem Improving Schwarz lemma for holomorphic maps between Hermitian manifolds.
method Introducing new curvature constraints on source and target manifolds, controlling by holomorphic sectional curvature.
result Significant improvements on the Wu--Yau theorem and Schwarz lemma for Gauduchon connections.
Schwarz lemma extended to equality cases and curvature on manifolds.
problem Extending Schwarz lemma to equality cases and studying curvature.
method Analyzing Schwarz lemma inequalities and equalities, studying holomorphic sectional curvature.
result Holomorphic maps are totally geodesic and have constant rank when Schwarz lemma equality holds.
Generalized Stacey-Roberts lemma for Banach manifolds.
problem Constructing Lie groupoids of smooth mappings in infinite-dimensional geometry.
method Generalization of the Stacey-Roberts lemma to Banach manifolds with smooth partitions of unity.
result Remedied an error in the original proof for finite-dimensional setting.
Thurston's jiggling lemma simplifies triangulations.
problem Simplifying triangulations into a general position.
method Alternative, conceptual proof and generalization to manifolds.
result A more straightforward proof of Thurston's jiggling lemma.
We give a new Tian-Todorov lemma on deformations of CR-structures and use it to reprove the deformation unobstructedness of normal compact strongly pseudoconvex CR-manifold under the assumption of d′d′′-lemma, more faithfully following Tian-Todorov's approach.
Abstract: Generalizes Milnor-Schwarz lemma to inverse monoids.
problem Applying Milnor-Schwarz lemma to inverse monoids.
method Two proofs provided: elementary and using Vietoris-Rips complex.
result Generalization of Milnor-Schwarz lemma to inverse monoids.
For the convenience of readers of the article {\em No-arbitrage pricing under systemic risk: accounting for cross-ownership} (Fischer, 2012, arXiv:1005.0768), a full proof of Lemma A.5 and a shorter proof of Lemma A.6 of that paper are provided.
The paper extends the Discrete Schwarz-Pick Lemma to circle packings with obtuse intersections and disjoint packings.
problem Proving the Discrete Schwarz-Pick Lemma for circle packings with various inversive distances.
method Using a variational principle for circle packings with inversive distances, the paper extends the lemma to a broader range of packings.
result The Discrete Schwarz-Pick Lemma holds for circle packings with inversive distances in (−1,1], provided an additional condition on triangle weights. New proof and insights on Elliptical Potential Lemma for online learning.
problem Limitations in the original proof of the Elliptical Potential Lemma.
method Proposes a new proof and new perspectives on the lemma.
result New flexibility in the type of potentials considered.
We observe that Whitehead's lemma is an immediate consequence of Stallings folds.
In this article, we prove an analog of the classical collar lemma in the setting of Hitchin representations.
The famous Švarc-Milnor Lemma says that a group G acting properly and cocompactly via isometries on a length space X is finitely generated and induces a quasi-isometry equivalence g→g⋅x0 for any x0∈X. We redefine the concept of coarseness so that the proof of the Lemma is automatic.
The L2-∂∂-Lemma is extended to complete Kähler manifolds with a gap in the spectrum.
problem Extending the L2-∂∂-Lemma to non-compact Kähler manifolds. method Proving the L2-∂∂-Lemma on complete Kähler manifolds with a gap in the spectrum. result The L2-∂∂-Lemma is generalized to complete Kähler manifolds. New CR almost Schur Lemma estimates curvature on compact manifolds.
problem Estimating curvature on compact pseudohermitian manifolds.
method Established a new CR almost Schur Lemma with specific positivity conditions.
result Estimates pseudohermitian scalar curvature as a constant.
In this note, we prove the sharp Davies-Gaffney-Grigor'yan lemma for minimal heat kernels on graphs.
Paper extends Weyl's lemma to RCD(K,N) spaces.
problem Applying Weyl's lemma to RCD(K,N) metric measure spaces.
method Extending Weyl's lemma to RCD(K,N) spaces and proving applications.
result Local regularity of solutions for Poisson equations and Liouville-type results for harmonic functions.
New method to recover over-parameterized models corrupted during estimation.
problem Recovering statistical models corrupted after initial estimation.
method Robust estimation using over-parameterized models and redundancy.
result Stochastic gradient descent is well-suited for model repair, but sparsity is generally not repairable.