Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

6531,3051,9582,610 · Jun 202019922001200920172026
48 results for collapse to the mean

New principles for collapsing law-invariant functionals to means, extending beyond convexity.

problem Conditions for law-invariant functionals to reduce to means.
method Establishing collapse to the mean principles for non-convex functionals.
result General principles apply beyond convexity, including quasiconvex and Choquet integrals.

Deep nets exhibit 'Neural Collapse' during training's final phase, simplifying decision-making.

problem Understanding and optimizing deep learning training phases.
method Direct measurements on three deepnet architectures across seven datasets.
result Deep nets exhibit 'Neural Collapse' during training's final phase, simplifying decision-making.

We provide a direct proof of a non-collapsing estimate for compact hypersurfaces with positive mean curvature moving under the mean curvature flow: Precisely, if every point on the initial hypersurface admits an interior sphere with radius inversely proportional to the mean curvature at that point, then this remains tr…

2011-08-01abs ↗pdf ↗

Deep nets trained with MSE loss exhibit Neural Collapse, collapsing features and classifiers to class means.

problem Understanding Neural Collapse in MSE-trained deep nets.
method Developed a new MSE loss decomposition and introduced the central path concept.
result Exact dynamics of Neural Collapse along the central path can be predicted.

We study the mean curvature flow of hypersurfaces in Rn+1\R^{n+1}, with initial surfaces sufficiently close to the standard nn-dimensional sphere. The closeness is in the Sobolev norm with the index greater than n2+1\frac{n}{2}+1 and therefore it does not impose restrictions of the mean curvature of the initial surface. W…

2011-10-24abs ↗pdf ↗

Bayesian deep learning faces posterior collapse due to likelihood vs. prior competition.

problem Posterior collapse in Bayesian deep learning models.
method Identified competition between likelihood and prior regularization in a linear latent variable model.
result Posterior collapse is related to neural and dimensional collapse, suggesting a broader learning issue.

This paper extends neural collapse to class-imbalanced datasets using an unconstrained ReLU feature model.

problem Understanding neural collapse in class-imbalanced datasets with cross-entropy loss.
method Generalized neural collapse to class-imbalanced settings using an unconstrained ReLU feature model.
result Class-means converge to orthogonal vectors with different lengths, and classifier weights align to these vectors.

New method uses geometric mean to avoid non-collapsibility in case-control studies.

problem Non-collapsibility of odds ratio under outcome-dependent sampling.
method Proposes geometric mean aggregation to avoid non-collapsibility and provides estimation and inference methods.
result Geometric odds ratio is collapsible under outcome-dependent sampling.

Deep linear networks exhibit collapsing features and classifiers across datasets.

problem Understanding the collapse of features and classifiers in deep linear networks.
method Theoretical and empirical analysis of deep linear networks with MSE and CE losses.
result Deep linear networks exhibit NC properties, collapsing features and classifiers to orthogonal vectors.

The paper studies how certain submanifolds collapse to lower-dimensional ones.

problem The study of mean curvature flow of submanifolds and their convergence behavior.
method Explicit examples of mean curvature flow of (2m-1)-dimensional submanifolds converging to (2m-2)-dimensional ones.
result Explicit examples of mean curvature flow of submanifolds converge to lower-dimensional submanifolds in complex manifolds.

New metrics improve scRNA-seq perturbation modeling by reducing mode collapse.

problem Outperformed by simple mean prediction in scRNA-seq perturbation modeling.
method Introduce DEG-aware metrics (WMSE, Rw2(Δ)R^{2}_{w}(Δ)) and negative/positive baselines.
result WMSE loss function reduces mode collapse and improves model performance.

In this paper we extend the works of Tancer and of Malgouyres and Francés, showing that (d,k)(d,k)-collapsibility is NP-complete for dk+2d\geq k+2 except (2,0)(2,0). By (d,k)(d,k)-collapsibility we mean the following problem: determine whether a given dd-dimensional simplicial complex can be collapsed to some kk-dimensional sub…

2017-03-20abs ↗pdf ↗

Theoretical work on mode collapse in variational inference models.

problem Mode collapse in variational inference models, where models focus on a few modes instead of all possible ones.
method Theoretical investigation of mode collapse in Gaussian mixture models, identifying key low-dimensional statistics and equations governing their evolution.
result Mode collapse is present even in favorable scenarios, driven by mean alignment and vanishing weight mechanisms.

We consider the mean curvature evolution of rotationally symmetric surfaces. Using numerical methods, we detect critical behavior at the threshold of singularity formation resembling the one of gravitational collapse. In particular, the mean curvature simulation of a one-parameter family of initial data reveals the exi…

2009-03-19abs ↗pdf ↗

We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical simple homotopy theory, the strong homotopy types can be described by elementary moves. An elementary move in this setting is called a strong collapse and it is a particular kind of simplicial collapse. The advantage of usi…

2009-07-17abs ↗pdf ↗

Study shows 'Ordinal Neural Collapse' in deep OR tasks, revealing simple geometric relationships.

problem Understanding neural collapse in deep Ordinal Regression tasks.
method Combining cumulative link models and Unconstrained Feature Model to investigate neural collapse.
result Demonstrates 'Ordinal Neural Collapse' (ONC) with three key properties.

This work justifies neural collapse under MSE loss and analyzes the optimization landscape.

problem Understanding neural collapse in deep neural networks under MSE loss.
method Global landscape analysis of vanilla nonconvex MSE loss.
result The only global minimizers are neural collapse solutions.

This paper extends neural collapse to imbalanced data under cross-entropy loss.

problem Analyzing neural collapse in deep networks with imbalanced data.
method Using the unconstrained feature model and cross-entropy loss, the paper studies neural collapse in imbalanced datasets.
result Feature vectors within the same class collapse to a single mean vector, but angles between them depend on sample size.

Neural collapse occurs in normalized features over a Riemannian manifold.

problem Understanding neural collapse in normalized feature models.
method Simplified multi-class classification task to a nonconvex optimization problem over the Riemannian manifold, analyzing the landscape of critical points.
result The only global minimizers are neural collapse solutions, with all other critical points being strict saddles.

Recent theoretical work has demonstrated that deep neural networks have superior performance over shallow networks, but their training is more difficult, e.g., they suffer from the vanishing gradient problem. This problem can be typically resolved by the rectified linear unit (ReLU) activation. However, here we show th…

2018-08-15abs ↗pdf ↗

This paper examines how different loss functions affect neural network features and performance.

problem Investigating which loss function is best for deep neural networks.
method Examining last-layer features of deep networks and drawing inspiration from the Neural Collapse phenomenon.
result All relevant loss functions (CE, LS, FL, MSE) produce equivalent features and similar performance.

We present a general method for deriving collapsed variational inference algo- rithms for probabilistic models in the conjugate exponential family. Our method unifies many existing approaches to collapsed variational inference. Our collapsed variational inference leads to a new lower bound on the marginal likelihood. W…

2012-06-22abs ↗pdf ↗

Variational autoencoders often collapse, showing latent variables are non-identifiable.

problem Posterior collapse in variational autoencoders due to non-identifiable latent variables.
method Proves latent variable non-identifiability causes posterior collapse. Proposes latent-identifiable models using Brenier maps and input convex neural networks.
result Latent-identifiable models resolve posterior collapse and provide meaningful representations.

Deep Gaussian Processes with polynomial kernels can collapse rapidly without proper hyperparameter tuning.

problem The collapse of Deep Gaussian Processes with polynomial kernels without careful hyperparameter tuning.
method Analysis using the Berry-Esseen Theorem and observation of prior behavior.
result The prior of a Deep Gaussian Process collapses rapidly towards zero or places negligible mass on low norm functions without proper hyperparameter tuning.

We study theoretical and empirical aspects of the mean exit time of financial time series. The theoretical modeling is done within the framework of continuous time random walk. We empirically verify that the mean exit time follows a quadratic scaling law and it has associated a pre-factor which is specific to the analy…

2005-07-06abs ↗pdf ↗

Our research proves neural collapse in deep ResNets and transformers is globally optimal.

problem Understanding neural collapse in deep learning models.
method Analysis of deep regularized transformers and ResNets trained with cross entropy or mean squared error loss.
result Global optima of deep regularized transformers and ResNets are approximately collapsed, becoming more prominent as depth increases.

Wide neural networks with weight decay exhibit neural collapse.

problem Proving neural collapse in wide neural networks trained with weight decay.
method Generic guarantees on neural collapse for wide networks with weight decay, proving low training error and balancedness, and bounded conditioning.
result First proof of neural collapse in end-to-end training of wide neural networks with weight decay.

New findings on how certain functionals behave in random variable spaces.

problem Understanding when law-invariant convex functionals simplify to the mean.
method Analyzing a broad class of random variable spaces and mild semicontinuity assumptions.
result The expectation functional is the only law-invariant convex functional that collapses to the mean under certain conditions.

Ancient solutions arise in the study of parabolic blow-ups. If we can categorize ancient solutions, we can better understand blow-up limits. Based on an argument of Giga and Kohn, we give a Liouville-type theorem restricting ancient, type-I, non-collapsing two- dimensional mean curvature flows to either spheres or cyli…

2017-11-07abs ↗pdf ↗

We prove an optimal control on the time-dependent measure of a measurable set under a reparametrized Lagrangian mean curvature flow of almost calibrated submanifolds in a Calabi-Yau manifold. Moreover we give a classification of those Lagrangian translating solitons in Cm\mathbb{C}^m that evolve by this reparametrized …

2018-01-22abs ↗pdf ↗

The paper explains how continuous language models can produce discrete, interpretable meanings.

problem Semantic collapse in continuous systems of large language models.
method Formalizing large language models as Continuous State Machines (CSMs) and analyzing the associated transfer operator.
result The leading eigenfunctions of the transfer operator induce a finite number of invariant meaning basins, explaining how continuous computation can produce discrete, interpretable semantics.

New data accumulation prevents model collapse in generative models.

problem Model collapse in generative models trained on their own outputs.
method Empirical study of language models, diffusion models, and variational autoencoders; analytically tractable framework for linear models.
result Accumulating synthetic data alongside real data avoids model collapse, preventing performance degradation.

A submanifold in space forms is isoparametric if the normal bundle is flat and principal curvatures along any parallel normal fields are constant. We study the mean curvature flow with initial data an isoparametric submanifold in Euclidean space and sphere. We show that the mean curvature flow preserves the isoparametr…

2007-06-25abs ↗pdf ↗

Study shows translators can have non-removable singularities at infinity but eventually converge to unique planes.

problem Understanding singularities and convergence of translators at infinity.
method Global analysis of quasilinear soliton equations, sharp non-standard elliptic decay estimates, and potential theory.
result Finite entropy, finite genus translators converge to uniquely determined planes at infinity.

Under mean curvature flow, a closed, embedded hypersurface M(t)M(t) becomes singular in finite time. For certain classes of mean-convex mean curvature flows, we show the continuity of the first singular time TT and the limit set "M(T)M(T)", with respect to initial data. We employ an Angenent-like neck-pinching argument to…

2017-03-07abs ↗pdf ↗