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,657 papers · 148 categories

Trend · papers per month

20395978 · May 202619922001200920172026
48 results for core collapse

Deep learning predicts nuclear equation of state from rotating core collapse GW signals.

problem Classifying the nuclear equation of state from rotating core collapse gravitational wave signals.
method Employed deep convolutional neural networks to classify visual and temporal patterns in GW signals.
result Up to 97% correct classifications of nuclear equation of state in the test set.

New examples of manifolds in tangent cones of non-collapsed Ricci limit spaces.

problem Uncertainty in homeomorphism types of tangent cones of non-collapsed Ricci limit spaces.
method Construction of limit spaces in all dimensions at least 5.
result Any finite collection of manifolds can appear as cross sections of tangent cones of the same point.

Use simplified layerwise linear models to understand neural dynamics.

problem Complex neural network dynamics are hard to grasp.
method Apply simplified layerwise linear models to explain neural phenomena.
result Simplified models explain neural collapse, emergence, etc.

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 ↗

Paper constructs geometric transitions between hyperbolic and Anti-de Sitter geometries.

problem Transitioning between hyperbolic and Anti-de Sitter geometries.
method Construction via Half-pipe geometry on ΣimesS1Σ imes\mathbb{S}^1 with cone singularities.
result Deformation of convex core structure as bending laminations collapse.

The paper proposes a new framework to generate synthetic data with human-like imperfections to prevent model collapse.

problem Model collapse due to statistical optimization of synthetic data.
method Introduces Prompt-driven Cognitive Computing Framework (PMCSF) with Cognitive State Decoder (CSD) and Cognitive Text Encoder (CTE).
result The framework generates text with cognitive imperfections, reducing maximum drawdown and delivering defensive alpha.

This study analyzes why attention layers in neural networks can cause signal loss and proposes a solution.

problem Pathological behavior of attention layers in neural networks, leading to signal loss.
method Spectral analysis using Random Matrix Theory to identify and mitigate rank collapse in width.
result A novel solution to mitigate rank collapse in width by removing outlier eigenvalues.

DRL agents perform poorly at high decision frequencies, but a new algorithm improves performance.

problem DRL agents struggle at high decision frequencies, leading to poor performance.
method Proved that DRL agents' action-conditioned return distributions collapse to their policy's return distribution as decision frequency increases. Defined superiority as a probabilistic generalization of advantage for high-frequency value-based RL.
result Proper modeling of superiority distribution improves performance of controllers at high decision frequencies.

This paper explores how kernel methods can explain data effects on neural collapse.

problem Understanding how data affects neural collapse in neural networks.
method Formulating NC1 as a function of kernel, specializing to NNGP and NTK, and exploring a data-aware Gaussian Process kernel.
result The NTK does not represent more collapsed features than the NNGP for Gaussian data, highlighting the limitations of data-independent kernels.

This paper reviews recent advancements in amortized Variational Inference.

problem Scalability and efficiency issues in traditional Variational Inference.
method Systematic review of various Variational Inference techniques, focusing on amortized approaches.
result Amortized Variational Inference improves scalability and efficiency for generative modeling tasks.

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.

Study on Neural Collapse limits in deep learning.

problem Understanding the limits of Neural Collapse in deep learning.
method Investigated Neural Collapse in the context of generalization and feature learning, refining conjectures and conducting experiments.
result Neural Collapse primarily occurs on the train set and not on the test set, suggesting it is an optimization phenomenon with unclear connections to generalization.

Mathematical analysis shows annealing prevents mode collapse in Gaussian mixtures.

problem Mode collapse in variational inference for multimodal distributions.
method Analyzed annealing strategies for Gaussian mixtures, derived formulas, and tested on neural networks.
result Appropriately chosen annealing schemes can robustly prevent mode collapse.

Despite excellent progress in recent years, mode collapse remains a major unsolved problem in generative adversarial networks (GANs).In this paper, we present spectral regularization for GANs (SR-GANs), a new and robust method for combating the mode collapse problem in GANs. Theoretical analysis shows that the optimal …

2019-08-29abs ↗pdf ↗

New method controls posterior collapse in VAEs without network architecture constraints.

problem Posterior collapse in VAEs reduces diversity of generated samples.
method Introduces Latent Reconstruction (LR) loss to control posterior collapse.
result Controls posterior collapse on various datasets without architectural constraints.

Collapsibility is a combinatorial strengthening of contractibility. We relate this property to metric geometry by proving the collapsibility of any complex that is CAT(0) with a metric for which all vertex stars are convex. This strengthens and generalizes a result by Crowley. Further consequences of our work are: (1) …

2011-07-28abs ↗pdf ↗

Prove that collapsing CSC metrics can be perturbed to invariant collapsing CSC metrics.

problem Prove that collapsing constant scalar curvature metrics can be perturbed to invariant collapsing constant scalar curvature metrics.
method Prove that a sequence of constant scalar curvature metrics which is collapsing with bounded curvature to a manifold can be perturbed to a sequence of invariant collapsing constant scalar curvature metrics.
result Prove that a sequence of constant scalar curvature metrics which is collapsing with bounded curvature to a manifold can be perturbed to a sequence of invariant collapsing constant scalar curvature metrics.

We will simplify the earlier proofs of Perelman's collapsing theorem of 3-manifolds given by Shioya-Yamaguchi and Morgan-Tian. Among other things, we use Perelman's semi-convex analysis of distance functions to construct the desired local Seifert fibration structure on collapsed 3-manifolds. The verification of Perelma…

2009-08-22abs ↗pdf ↗

Lower Ricci curvature bound prevents first Betti number from dropping more than dimension in collapsing manifolds.

problem Understanding how the first Betti number behaves under manifold collapse with Ricci curvature bounds.
method Analyzing sequences of Riemannian manifolds with lower Ricci curvature bounds.
result The first Betti number cannot drop more than the dimension in collapsing manifolds.

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.

Study tackles criterion collapse in learning criteria, showing conditions for loss minimization.

problem Criterion collapse in optimization, focusing on error probability minimizers.
method Analyzes various learning criteria, including DRO, OCE risks, and non-monotonic criteria.
result Non-monotonic criteria can avoid collapse, while monotonic ones cannot.

In complex systems like financial market, risk tolerance of individuals is crucial for system resilience.The single-security price limit, designed as risk tolerance to protect investors by avoiding sharp price fluctuation, is blamed for feeding market panic in times of crash.The relationship between the critical market…

2019-08-20abs ↗pdf ↗

This is an expositiry article on collapsing theory in Riemannian geometry written for the Modern Encyclopedia of Mathematical Physics (MEMPhys). We focus on describing the geometric and topological structure of collapsed/non-collapsed regions in Riemannian manifold under various curvature assumptions. Numerous applicat…

2007-01-25abs ↗pdf ↗

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 ↗

In this paper, we study collapsed manifolds with boundary, where we assume a lower sectional curvature bound, two sides bounds on the second fundamental forms of boundaries and upper diameter bound. Our main concern is the case when inradii of manifolds converge to zero. This is a typical case of collapsing manifolds w…

2015-12-26abs ↗pdf ↗

This paper establishes an equivalence between transitive double Lie algebroids and core diagrams.

problem Understanding and characterizing transitive double Lie algebroids.
method Using core diagrams and equivalence of transitive core diagrams with transitive double Lie groupoids.
result Transitive double Lie algebroids are completely determined by their core diagrams.

This paper examines how skip connections prevent rank collapse in sequence models.

problem Rank collapse in sequence models, leading to reduced expressivity and training instabilities.
method Analytical and ablation studies of lambda-skip connections in SSMs.
result A sufficient condition to prevent rank collapse across various architectures.

Study on removing sets and uniqueness of diffusion operators on various spaces.

problem Determining the effect of removing small sets on the self-adjointness and uniqueness of diffusion operators.
method Analyzes symmetric diffusion operators on metric measure spaces, proving a truncation result for potentials.
result Characterizes the critical size of removed sets and their effect on operator properties.

The paper studies a relative version of non-positive immersion for 2-complex pairs and shows conditions under which a transitivity law holds.

problem The study of collapsing non-positive immersion for 2-complex pairs and its implications.
method Introduced a relative version of collapsing non-positive immersion for 2-complex pairs (L,K)(L,K) and proved a transitivity law under certain conditions.
result Under certain conditions, a transitivity law holds: If (L,K)(L,K) has relative collapsing non-positive immersion and KK has collapsing non-positive immersion, then LL has collapsing non-positive immersion.

ContraNorm prevents dimensional collapse in GNNs and Transformers.

problem Dimensional collapse in Graph Neural Networks and Transformers.
method Proposes ContraNorm, a novel normalization layer inspired by contrastive learning.
result Proves ContraNorm alleviates both complete and dimensional collapse under certain conditions.

We will simplify earlier proofs of Perelman's collapsing theorem for 3-manifolds given by Shioya-Yamaguchi and Morgan-Tian. Among other things, we use Perelman's critical point theory (e.g., multiple conic singularity theory and his fibration theory) for Alexandrov spaces to construct the desired local Seifert fibratio…

2010-03-10abs ↗pdf ↗

Polyhedra collapse to subpolyhedra if they can be continuously shrunk onto them.

problem Characterizing when a polyhedron can be continuously shrunk onto a subpolyhedron.
method Piecewise-linear free deformation retraction and metric considerations.
result A polyhedron collapses to a subpolyhedron if and only if it admits a free deformation retraction onto that subpolyhedron.

We study collapsed manifolds with Ricci bounded covering geometry i.e., Ricci curvature is bounded below and the Riemannian universal cover is non-collapsed or consists of uniform Reifenberg points. Via Ricci flows' techniques, we partially extend the nilpotent structural results of Cheeger-Fukaya-Gromov, on collapsed …

2018-08-11abs ↗pdf ↗

Finite simply connected 2-complexes with nonpositive planar curvature are collapsible.

problem Understanding the collapsibility of 2-complexes with specific curvature properties.
method Analyzing the fundamental groups and sectional curvatures of 2-complexes.
result Finite simply connected 2-complexes with nonpositive planar curvature are collapsible.