Introduces mobility algebra for modeling geodesics on n-spheres.
problem Modeling geodesics on n-spheres using algebraic structures.
method Introduces mobility algebra and mobility spaces, showing connections to modules and affine spaces.
result Shows geodesics on n-spheres as mobility spaces over unit interval mobility algebra.
In this article we study various analytic aspects of interpolating sesqui-harmonic maps between Riemannian manifolds where we mostly focus on the case of a spherical target. The latter are critical points of an energy functional that interpolates between the functionals for harmonic and biharmonic maps. In the case of …
We introduce several techniques for sampling and visualizing the latent spaces of generative models. Replacing linear interpolation with spherical linear interpolation prevents diverging from a model's prior distribution and produces sharper samples. J-Diagrams and MINE grids are introduced as visualizations of manifol…
DELIMIT is a framework extension for deep learning in diffusion imaging, which extends the basic framework PyTorch towards spherical signals. Based on several novel layers, deep learning can be applied to spherical diffusion imaging data in a very convenient way. First, two spherical harmonic interpolation layers are a…
The paper improves stability estimates for soap bubble theorem in curved domains.
problem Stability estimates for the Soap Bubble Theorem in curved domains.
method Leveraging Gagliardo-Nirenberg-type interpolation inequalities.
result Optimal stability estimates for Lr deviations of mean curvature from being constant. SLERP interpolation optimizes dynamic weight rebalancing in AMMs.
problem Optimizing dynamic weight rebalancing in automated market makers (AMMs).
method Riemannian geometry and SLERP interpolation.
result SLERP interpolation minimizes the KL divergence loss in dynamic weight rebalancing.
Paper investigates optimal interpolation methods in linear regression.
problem Understanding when interpolating methods generalize well in linear regression.
method Investigates optimal response-linear interpolators using functions linear in the response variable.
result Provides a closed-form expression for the optimal interpolator and shows it can be derived as the limit of gradient descent.
Tensor decomposition recovers Gaussian mixtures from moments.
problem Recovering Gaussian mixture models from datasets.
method Symmetric tensor decomposition of moment tensors built from empirical moments.
result Identifiable tensors with interpolation degree less than half their order.
The paper studies optimal transport in linear quadratic systems and derives interpolation inequalities.
problem Optimal transport problem in Linear Quadratic optimal control systems.
method Well-posedness of the Monge problem, regularity of optimal transport map, displacement interpolation of measures.
result Derivation of general interpolation inequalities for entropy functionals.
Deep linear networks can closely approximate interpolants without improving risk.
problem Understanding the risk bounds of deep linear networks compared to minimum ℓ2-norm solutions. method Bounding excess risk of interpolating deep linear networks trained using gradient flow.
result Deep linear networks can closely approximate or match minimum ℓ2-norm solutions in terms of risk. Study of line bundles on spherical varieties leads to Calabi-Yau metrics.
problem Understanding linearized line bundles on spherical varieties.
method Formulas for valuative invariants and application to Fano spherical varieties.
result Calabi-Yau metrics on spherical varieties' cone.
A new tradeoff between regularization and sharpness improves model performance in overparameterized settings.
problem Improving model performance in overparameterized settings with minimum-norm interpolators.
method Proposes a regularization-sharpness tradeoff for overparameterized linear regression with an ℓ^p penalty.
result Empirical validation shows the tradeoff terms can distinguish performant linear interpolators.
New bounds for linear interpolators show how they generalize under covariate shifts.
problem Understanding how linear interpolators generalize under covariate shifts.
method Proved non-asymptotic excess risk bounds for benignly-overfit linear interpolators in transfer learning.
result Identified beneficial and malignant covariate shifts based on overparameterization degree.
Study shows directional convergence for neural networks under spherical symmetry.
problem Learning linear predictors with neural networks under spherically symmetric data.
method Analysis of gradient flow and gradient descent for two-layer and deep linear networks.
result Directional convergence guarantees with exact convergence rate for specific network architectures.
The study tests inferences about neural network optimization from linear interpolation of loss landscapes.
problem Understanding the difficulty of neural network optimization problems.
method Linear interpolation of neural network loss landscapes, systematic evaluation of various factors.
result Linear interpolation does not correlate with model performance, challenging prior intuition.
REPAIR mitigates variance collapse to enable linear interpolation between SGD solutions.
problem Linear interpolation between SGD solutions is difficult due to variance collapse in permuted activations.
method REPAIR rescales preactivations of interpolated networks to mitigate variance collapse.
result 60%-100% relative barrier reduction across various architectures and tasks.
This paper analyzes error in SKI for Gaussian Processes, providing conditions for linear time inference.
problem Lack of rigorous theoretical error analysis for SKI.
method Proved error bounds for SKI Gram matrix, examined error effects, provided practical guidelines.
result Identified two dimensionality regimes for SKI's scalability-accuracy trade-offs.
A new image interpolation model using sparse representation and nonlocal linear regression.
problem Image interpolation without blurring and noise.
method Sparse representation, nonlocal self-similarity, nonlocal linear regression, adaptive sub-dictionary learning, weighted encoding.
result Our method outperforms state-of-the-art methods in quantitative measures and visual quality.
Study optimizes linear regression analysis for high-dimensional settings.
problem Understanding high-dimensional linear regression with interpolation and regularization.
method Localized uniform convergence analysis of optimistic rates for linear regression.
result Recover guarantees for ridge and LASSO regression under random designs.
Optimal machine learning requires interpolating training data in high-dimensional linear regression.
problem Achieving optimal predictive risk in overparameterized linear regression models.
method Analyzing proportional asymptotics of random design and label noise variance.
result Optimal performance in linear regression requires fitting training data to higher accuracy than inherent noise.
Gradient flow in parameters equals linear interpolation in outputs.
problem Understanding and optimizing training algorithms in deep learning.
method Proving equivalence between gradient flow in parameter space and linear interpolation in output space, and deriving formulas for global minima.
result Gradient flow in parameters can be transformed into linear interpolation in outputs, leading to global minima.
The paper extends a variance gamma model to quadratic functions, reducing arbitrage and computational costs.
problem Creating an arbitrage-free interpolation for option pricing models.
method Generalizing the local variance gamma model to a piecewise quadratic local variance function.
result The quadratic model results in an arbitrage-free interpolation of class C3, reducing knots and computational cost.
Bagging stabilizes linear interpolators, improving their generalization performance.
problem Unstable linear interpolators fail on noisy data.
method Introduced multiplier-bootstrap-based bagged least square estimator.
result Bagging effectively mitigates variance, leading to bounded prediction risk.
Derives TAP approximation for Bayesian linear regression.
problem Log-normalizing constant of posterior distribution in high-dimensional linear regression.
method Variational representation and Thouless-Anderson-Palmer approximation.
result Proves TAP approximation for spherical prior in proportional asymptotic regime.
Monotonic Linear Interpolation property in neural networks persists despite non-convexity.
problem Understanding the geometric properties of neural network loss landscapes.
method Tools from differential geometry to analyze the monotonicity of neural network weights.
result Sufficient conditions for the Monotonic Linear Interpolation property under mean squared error.
The monotonic linear interpolation in deep networks often leads to plateaus, revealing biases in optimization.
problem Plateaus in the optimization landscape of deep networks during monotonic linear interpolation.
method Investigated monotonic linear interpolation on deep neural networks, focusing on biases in weights and biases.
result Interpolating weights and biases differently can lead to significant differences in loss and accuracy, revealing biases in optimization.
The consideration of the so-called rotation minimizing frames allows for a simple and elegant characterization of plane and spherical curves in Euclidean space via a linear equation relating the coefficients that dictate the frame motion. In this work, we extend these investigations to characterize curves that lie on a…
Lower bounds show OLS outperforms basis pursuit in overparameterized linear regression.
problem Excess risk of sparse interpolating procedures in overparameterized linear regression.
method Proved lower bounds on excess risk for OLS and basis pursuit.
result Excess risk of basis pursuit can converge at an exponentially slower rate than OLS.
Study finds exact limits for sparse regression with fewer observations than usual.
problem Understanding sparse linear regression with sublinear sparsity.
method Adaptive interpolation method and modified AMP algorithm.
result Exact asymptotic expressions for mutual information and MMSE in sublinear sparsity.
Study free energy in spherical spin glasses, proving universality dichotomy.
problem Analyzing free energy in spherical spin glass models with different tail exponents.
method Introduced a tail-adapted normalization and used universality dichotomy.
result Sharp universality dichotomy for free energy across different tail exponents.
New model leads to optimal test loss in sparse linear regression.
problem Sparse linear regression with low test loss despite interpolating training data.
method Developed a new parametrization of the model that combines benefits of ℓ1 and ℓ2 norms.
result Training via gradient descent leads to an interpolator with near-optimal test loss.
Interpolation hurts robust generalization even without noise.
problem The challenge of robust generalization in the absence of noise.
method Avoiding interpolation through ridge regularization.
result Ridge regularization improves robust generalization.
A continuing mystery in understanding the empirical success of deep neural networks is their ability to achieve zero training error and generalize well, even when the training data is noisy and there are more parameters than data points. We investigate this overparameterized regime in linear regression, where all solut…
Generative Latent Implicit Conditional Optimization (GLICO) learns from small samples.
problem Learning from small labeled datasets.
method Generative Latent Implicit Conditional Optimization (GLICO) learns a latent space and generator from small labeled data.
result GLICO synthesizes new samples for every class using as few as 10 examples per class.
SKI accelerates GP inference with sparse grids to handle higher dimensions.
problem SKI scales poorly in high dimensions due to dense grid size.
method Sparse grids within SKI framework, novel matrix-vector multiplication algorithm.
result SKI can be scaled to higher dimensions while maintaining accuracy.
Researchers found new functions for spherical clothoids using special functions.
problem Developing new mathematical functions for spherical clothoids.
method Used confluent hypergeometric functions and Meixner-Pollaczek polynomials.
result Presented Cartesian coordinate functions and stereographic projections.
This paper analyzes the interpolation error of nonlinear Attention compared to linear regression.
problem Understanding the interpolation error of nonlinear Attention in high-dimensional settings.
method Derives explicit expressions for mean-squared interpolation error using signal-plus-noise model and random matrix theory.
result Nonlinear Attention generally incurs a larger interpolation error than linear regression, but this gap can be reversed with structured signals.
Adversarial training improves linear regression solutions, revealing sparsity and abrupt interpolation.
problem Adversarial attacks on linear regression models.
method Formulated as a convex problem, adversarial training is used to find robust solutions that are sparse and interpolate data.
result Adversarial training with small disturbances gives the solution with the minimum-norm that interpolates the training data, revealing abrupt transition into interpolation.
Abstract: Studies systems of equations for pseudo-spherical or spherical surfaces, finding integrability conditions and new families of equations.
problem Characterize and classify systems of equations describing pseudo-spherical or spherical surfaces.
method Integrability conditions of g-valued linear problems, with g=sl(2,R) or g=su(2). result Obtained characterization and classification results, providing new examples and families of differential equations.
Study on RF regression with SGD shows double descent phenomenon.
problem Understanding generalization in RF models trained with SGD.
method Precise non-asymptotic error bounds derived for RF regression under constant and polynomial-decay step-size SGD.
result RF regression generalizes well for interpolation learning and exhibits double descent behavior.
We prove that M. Kramer's classification of list of spherical pairs coincides with that for weakly symmetric spaces by examining the linear isotropy representation of the corresponding homogeneous space associated to each pair.
Noise affects the effectiveness of interpolating models, especially those with strong inductive biases.
problem The impact of noise on interpolating models with strong inductive biases.
method Analyzing linear and classification models with sparse ground truths, proving fast rates for interpolators.
result Strong inductive biases can lead to faster but noisier interpolators, contrary to intuition.
We introduce semisimple 2-categories, fusion 2-categories, and spherical fusion 2-categories. For each spherical fusion 2-category, we construct a state-sum invariant of oriented singular piecewise-linear 4-manifolds.
Injectivity of geodesic ray transform on specific Finsler manifolds proven.
problem Injectivity of geodesic ray transform on spherically symmetric reversible Finsler manifolds.
method Reduction to invertibility of generalized Abel transforms using angular Fourier series and Taylor expansions of geodesics.
result Injectivity of geodesic ray transform proven on specified Finsler manifolds.
We investigate the properties of multidimensional probability distributions in the context of latent space prior distributions of implicit generative models. Our work revolves around the phenomena arising while decoding linear interpolations between two random latent vectors -- regions of latent space in close proximit…
The paper studies the minimum ℓ₁-norm interpolator's risk behavior in over-parameterized settings.
problem Understanding the risk behavior of minimum ℓ₁-norm interpolators in high-dimensional settings.
method Exact characterization of the risk behavior through a system of two non-linear equations.
result Observation of a multi-descent phenomenon in the generalization risk of the minimum ℓ₁-norm interpolator.
It is known that the so-called rotation minimizing (RM) frames allow for a simple and elegant characterization of geodesic spherical curves in Euclidean, hyperbolic, and spherical spaces through a certain linear equation involving the coefficients that dictate the RM frame motion (da Silva, da Silva in Mediterr J Math …
Uniform convergence of interpolators proven for Gaussian data.
problem Interpolation learning in high-dimensional linear regression with Gaussian data.
method Generic uniform convergence guarantee in terms of Gaussian width.
result Consistency of interpolators for minimum-norm and near-minimal-norm cases.