Classifies stability of flat-core p-elasticae pinned at boundaries.
problem Stability of flat-core p-elasticae under pinned boundary conditions. method Classification based on previous work for all p∈(1,∞) and d≥2. result Completes the classification of stable pinned p-elasticae in Rd. Small deformations of marginally (outer) trapped surfaces are considered by using their stability operator. In the case of spherical symmetry, one can use these deformations on any marginally trapped round sphere to prove several interesting results. The concept of 'core' of a black hole is introduced: it is a minimal …
Empty core found in max-loss non-centroid clustering.
problem Core stability in non-centroid clustering under max-loss objective.
method Proof for all k≥3 and n≥9 agents, computer-aided proof for 2D Euclidean points.
result Core can be empty in non-centroid clustering under max-loss objective.
Small deformations of marginally outer trapped surfaces (MOTS) are studied by using the stability operator introduced by Andersson-Mars-Simon. Novel formulae for the principal eigenvalue are presented. A characterization of the many marginally outer trapped tubes (MOTT) passing through a given MOTS is given, and the po…
AKO improves stability and power of Knockoff inference.
problem Instability of Knockoff-based inference.
method Aggregation of Multiple Knockoffs (AKO) method.
result AKO maintains FDR control while improving stability and power.
Stabilizes complex systems using diffusion models trained on Lyapunov functions.
problem Generating stabilizing controllers for complex dynamical systems.
method Trains a diffusion model on pairs of asymptotically stable vector fields and their Lyapunov functions to identify the closest stable field and adjust control functions.
result Efficient and rapid stabilization of unseen systems, showcasing generalizability.
Study shows exponential sample complexity for stabilizing certain linear systems.
problem Statistical hardness of learning to stabilize linear time-invariant systems.
method Analysis of sample complexity and co-stabilizability using robust control ideas.
result Sample complexity increases exponentially with system dimension.
The structure of the control network of transnational corporations affects global market competition and financial stability. So far, only small national samples were studied and there was no appropriate methodology to assess control globally. We present the first investigation of the architecture of the international …
We stabilize the Kumaraswamy distribution for efficient sampling and differentiation.
problem Numerical instabilities in the Kumaraswamy distribution's inverse CDF and log-pdf.
method Identified and resolved numerical issues, introduced a stabilized KS distribution.
result Stabilized Kumaraswamy distribution supports efficient sampling and differentiation.
Let M be a closed 3-manifold with a given Heegaard splitting. We show that after a single stabilization, some core of the stabilized splitting has arbitrarily high distance with respect to the splitting surface. This generalizes a result of Minsky, Moriah, and Schleimer for knots in S^3. We also show that in the comple…
Paper uses Ricci curvature to measure and forecast China's stock market stability.
problem Measuring and predicting systemic stability of China's stock market.
method Geometric measure derived from discrete Ricci curvature applied to financial networks.
result Ricci curvature effectively captures market stability and predicts future trends.
Foundation for learning in changing conditions.
problem Learning under varying conditions and states.
method Admissible transport, protected-core preservation, and evaluator-aware learning evolution.
result Established first theorem-supporting layer for regime-varying learning.
The seriousness of the current crisis urgently demands new economic thinking that breaks the austerity vs. deficit spending circle in economic policy. The core tenet of the paper is that the most important problems that natural and social science are facing today are inverse problems, and that a new approach that goes …
Many of our core assumptions about how neural networks operate remain empirically untested. One common assumption is that convolutional neural networks need to be stable to small translations and deformations to solve image recognition tasks. For many years, this stability was baked into CNN architectures by incorporat…
Foundation models alter medical data science workflow, challenging veridical data science principles.
problem Foundation models disrupt traditional data science practices in medicine.
method Critically examined the medical foundation model lifecycle and its deviation from veridical data science principles.
result Foundation models challenge veridical data science principles of predictability, computability, and stability.
This paper provides a mathematical framework for time-delay reservoir computing.
problem Lack of rigorous mathematical foundations for reservoir computing properties.
method Control-theoretic framework, formal definitions of separation and fading memory, explicit lower bound derivation.
result Established formal definitions and connections to stability notions for time-delay systems.
Geometrically classifies total stability spaces for Dynkin diagrams.
problem Classifying total stability spaces for triangulated categories.
method Constructing a geometric model of root categories as hQ-gons and proving isomorphisms. result Total stability spaces ToStDb(Q)/[2] are isomorphic to moduli spaces of stable hQ-gons. Two-layer networks struggle with high frequencies due to numerical and computational limitations.
problem High frequency approximation and learning in shallow networks.
method Mathematical and computational analysis focusing on numerical error, computational cost, and stability.
result Explicit answers to fundamental computational issues in shallow networks' high frequency handling.
We provide abelianizations of differentiable actions of finite groups on smooth real manifolds. De Concini-Procesi wonderful models for (local) subspace arrangements and a careful analysis of linear actions on real vector spaces are at the core of our construction. In fact, we show that our abelianizations have stabili…
Regularization improves stability and consistency of sparse autoencoders.
problem Varying features across random seeds and training choices in SAEs.
method Added L1 or L2 penalties on encoder and decoder weights.
result L2 regularization increases cross-seed feature consistency.
We introduce a notion of positive pair of contact structures on a 3-manifold which generalizes a previous definition of Eliashberg-Thurston and Mitsumatsu. Such a pair gives rise to a locally integrable plane field λ. We prove that if λ is uniquely integrable and if both structures of the pair are tight, then the i…
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.
The paper introduces μK-stability for polarized schemes and develops equivariant calculus.
problem The existence of μ-cscK metrics and their stability. method Develops equivariant calculus and introduces μ-character to study μK-stability. result Derives μ-Futaki invariant and an equivariant first Chern class for general test configurations. Develops a framework for distilling flow models from few steps.
problem Improving few-step sampling in diffusion models for better performance.
method Local approximation errors and dynamical amplification controlled through analytical tractability.
result Deep residual compositions efficiently approximate long-horizon transport with controlled global error.
New peripheral structure for core groups detects noninvertible knots.
problem Detecting noninvertible knots and links.
method Introduced a new peripheral structure for core groups.
result The new structure detects noninvertibility of some knots and links.
In various application areas, networked data is collected by measuring interactions involving some specific set of core nodes. This results in a network dataset containing the core nodes along with a potentially much larger set of fringe nodes that all have at least one interaction with a core node. In many settings, t…
ALℓ0CORE tensor decomposition reduces computational cost for sparse count data.
problem Efficiently decompose sparse count data matrices.
method Probabilistic Tucker decomposition with ℓ0-norm constraint. result ALℓ0CORE achieves similar results to full Tucker decomposition at a fraction of the cost. Interbank markets are often characterised in terms of a core-periphery network structure, with a highly interconnected core of banks holding the market together, and a periphery of banks connected mostly to the core but not internally. This paradigm has recently been challenged for short time scales, where interbank ma…
We introduce the notion of the visual core of a hyperbolic 3-manifold N and explore its basic properties. The visual core can be thought of as a harmonic analysis analogue of the convex core. We investigate circumstances in which the visual core of a cover N' of N embeds under the covering map from N' to N. We apply th…
New combinatorial structures represent subgroups of surface groups, analogous to Stallings core graphs.
problem Representing subgroups of surface groups in a combinatorial way.
method Introducing core surfaces as 2-dimensional complexes made up of vertices, labeled edges, and 4g-gons.
result Core surfaces are compact when corresponding subgroups are finitely generated.
AdamNX improves Adam's stability by adjusting its learning rate.
problem Adam's tendency to converge to non-flat minima in large-scale models.
method Proposes a novel exponential decay mechanism for Adam's second-order moment estimate.
result AdamNX outperforms Adam and its variants in stability and performance.
Paper introduces a core-periphery model for identifying informative network structures.
problem Noise and bias in non-informative periphery structures obscure the informative core in complex networks.
method Spectral algorithms for core identification as a preprocessing step for network analysis.
result The proposed method outperforms traditional core-periphery methods in various downstream tasks.
A fractal approach to the long-short portfolio optimization is proposed. The algorithmic system based on the composition of market-neutral spreads into a single entity was considered. The core of the optimization scheme is a fractal walk model of returns, optimizing a risk aversion according to the investment horizon. …
Estimates covariance matrices for matrix-variate data via core covariance geometry.
problem Estimating covariance matrices for matrix-variate data with partial isotropy.
method Fixed-rank core covariance geometry, partial-isotropy rank-r core shrinkage estimator.
result The geometry of the space of rank-r cores is a smooth manifold.
A new algorithm speeds up elliptical slice sampling for truncated multivariate normals.
problem Efficiently sampling from truncated multivariate normal distributions with linear constraints.
method Adapting elliptical slice sampling to linearly truncated multivariate normals, with an algorithm for ellipse-polytope intersection in O(m log m) time.
result The algorithm enhances numerical stability, speeds up running time, and is easy to parallelize.
Conservative Policy Iteration (CPI) is a founding algorithm of Approximate Dynamic Programming (ADP). Its core principle is to stabilize greediness through stochastic mixtures of consecutive policies. It comes with strong theoretical guarantees, and inspired approaches in deep Reinforcement Learning (RL). However, CPI …
Probabilistic programming aids in automatically dating ice cores, reducing manual error and uncertainty.
problem Automatically dating ice cores with high accuracy and capturing uncertainty.
method Probabilistic models and probabilistic programming for automatic inference.
result Demonstrated the use of probabilistic programming for ice core dating, showcasing its benefits and limitations.
The term "CoRE kernel" stands for correlation-resemblance kernel. In many applications (e.g., vision), the data are often high-dimensional, sparse, and non-binary. We propose two types of (nonlinear) CoRE kernels for non-binary sparse data and demonstrate the effectiveness of the new kernels through a classification ex…
We obtain upper and lower bounds on the difference between the renormalized volume and the volume of the convex core of a convex cocompact hyperbolic 3-manifold which depend on the injectivity radius of the boundary of the universal cover of the convex core and the Euler characteristic of the boundary of the convex cor…
New algorithm detects cores in graphs with community structure, improving vertex selection for better clustering.
problem Understanding and detecting core-periphery structures in graphs with community structure.
method Introduces relative centrality to detect cores in graphs with community and core-periphery structures.
result Relative centrality solves bias issues in core detection, leading to better vertex selection and improved clustering performance.
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.
This study examines cores within superclusters, highlighting their transitional nature and dynamical state.
problem Understanding the morphology and dynamical properties of cores within superclusters.
method Projected and radial velocity distributions of galaxies, morphological analysis, entropy and mass estimates.
result Cores are transitional structures that evolve towards virialisation but remain gravitationally bound.
The study allows for connected sums in manifolds with positive intermediate Ricci curvature.
problem Performing connected sums in manifolds with positive intermediate Ricci curvature.
method Introducing and utilizing k-core metrics to show the possibility of connected sums. result Connected sums are possible under certain conditions involving k-core metrics. The paper explores how word embeddings affect the stability of downstream NLP models.
problem Small changes in training data can cause significant changes in model predictions.
method Empirical and theoretical analysis of embedding instability, including the introduction of eigenspace instability measure.
result Increasing embedding memory can reduce the disagreement in predictions by 5% to 37%.
Study signatures of torus links and their cores using Neumann's equivariant signatures and Hirzebruch's formula.
problem Computing signatures of torus links and their cores.
method Use Neumann's equivariant signatures and rewrite Hirzebruch's formula for torus links (without cores) in terms of integral points in a parallelogram.
result Rewritten Hirzebruch's formula for torus links with cores using integral points in a parallelogram.
Proves NP and co-NP status for knot core recognition in solid torus.
problem Determining if a knot is the core of a solid torus.
method Alternate proof and corollary of Hopf link recognition problem.
result Proves NP and co-NP status for solid torus core recognition problem.
New method estimates extreme outcomes in heavy-tailed data, breaking circular dependence.
problem Estimating outcomes for extreme events in heavy-tailed data.
method Proposes an ADRF estimator that includes a structured tail-shape output and a diagnostic to evaluate tail shape.
result Successfully reduces MAE in deep-tail and conditional-shortfall predictions.
Core groups are link invariants defined by arc or region presentations.
problem Defining link invariants using different presentations of arcs and regions.
method Introducing core groups as link invariants defined by presentations involving arcs or regions, and extending these to virtual link diagrams.
result Properties of core groups and their extensions to virtual link diagrams are discussed.