Tian's theorem connects Chern classes of bundles to random section zeros and degeneracy sets.
problem Understanding the distribution of zeros and degeneracy sets of random holomorphic sections.
method Analyzing the pullback of Chern classes and computing currents of integration.
result The limit distribution of zeros of random sections is determined by the Chern form.
The paper studies the distribution of random degeneracy sets on complex manifolds.
problem Distribution of random degeneracy sets on compact Kähler manifolds.
method Asymptotic expansion of induced Grassmannian Chern forms, meromorphic transforms, and Wishart distribution.
result Normalized currents converge to curvature forms with quantitative estimates.
Proposes a new Gaussian factor for probabilistic inference with degenerate settings.
problem Handling linear dependencies among random variables in Gaussian networks.
method Introduces a parametrised factor that relaxes the positive-definite constraint of the covariance matrix.
result Accurately accommodates degeneracies in probabilistic inference without significant computational overhead.
We investigate the problem of semi-parametric maximum likelihood under constraints on summary statistics. Such a procedure results in a discrete probability distribution that maximises the likelihood among all such distributions under the specified constraints (called estimating equations), and is an approximation to t…
Research on mixed polynomials, extending non-degeneracy concepts to complex variables.
problem Extending non-degeneracy concepts to mixed polynomials in complex variables.
method Generalization of Mondal's partial non-degeneracy to mixed polynomials, introducing new concepts and proving properties.
result Strong partial non-degeneracy implies isolated singularities, and mixed polynomials that are strongly inner non-degenerate satisfy the strong Milnor condition.
Network degeneracy affects training performance, especially in deep networks.
problem Degeneracy in deep neural networks leads to poor training performance.
method Predicted degeneracy level correlates with training dynamics using finite and infinite width networks.
result Degeneracy in neural networks correlates with training performance and can be predicted.
Study shows how Laplacian semi-supervised learning behaves at low labeling rates.
problem Understanding behavior of Laplacian semi-supervised learning at very low label rates.
method Analysis of random geometric graphs and Γ-convergence tools. result For certain conditions, Laplacian learning becomes degenerate and spikes form; for others, it remains well-posed and consistent.
We construct a complete convergent normal form for a real hypersurface in $\CC{N},\,N\geq 2$ at generic Levi degeneracy. This seems to be the first convergent normal form for a Levi-degenerate hypersurface. In particular, we obtain, in the spirit of the work of Chern and Moser \cite{chern}, distinguished curves in the …
Stability of the utility maximization problem with random endowment and indifference prices is studied for a sequence of financial markets in an incomplete Brownian setting. Our novelty lies in the nonequivalence of markets, in which the volatility of asset prices (as well as the drift) varies. Degeneracies arise from …
Study optimal hedging for claims with random weights in discrete time.
problem Optimal hedging for claims with random weights in discrete time.
method Explicit recursive representation of optimal hedging strategy, without ND condition.
result Obtained explicit optimal hedging strategy in a recursive form.
Investigates metric degeneracies on symplectic leaves using a generalized gradient flow.
problem Degeneracies in metrics on symplectic leaves of Poisson manifolds.
method Introduces the generalized double bracket (GDB) vector field to generalize gradient dynamics.
result Identifies admissible regions where the double bracket metric remains non-degenerate on symplectic leaves, enabling GDB as a gradient flow.
This paper considers a classical question of approximation of Brownian motion by a random walk in the setting of a sub-Riemannian manifold M. To construct such a random walk we first address several issues related to the degeneracy of such a manifold. In particular, we define a family of sub-Laplacian operators natur…
For regular particle filter algorithm or Sequential Monte Carlo (SMC) methods, the initial weights are traditionally dependent on the proposed distribution, the posterior distribution at the current timestamp in the sampled sequence, and the target is the posterior distribution of the previous timestamp. This is techni…
Geometric regularisation improves statistical models by avoiding degeneracy loci.
problem Non-identifiability, singular information, and moment indeterminacy in statistical models.
method Develops the geometric regularisation of distribution-kernel pairs (T,φ) using Whitney, Thom, and Mather theorems. result Finite-dimensional weak transversality theorem for generic kernels, avoiding degeneracy strata of high codimension.
The paper proves that Gaussian field critical points have finite moments.
problem Proving the finiteness of moments for Gaussian field critical points.
method General approach not specific to critical points, using Taylor polynomial non-degeneracy.
result The finiteness of moments of the number of critical points of Gaussian fields.
Classifies patterns of symmetry breaking and vacuum degeneracy in scalar and gauge fields.
problem Understanding patterns of symmetry breaking and vacuum degeneracy in complex field systems.
method Uses mathematical classification of singular foliations to encode and classify patterns of spontaneous symmetry breaking and vacuum degeneracy.
result Mathematical classification provides a qualitative understanding of possible patterns of vacuum degeneracy.
CP degeneracy affects tensor regression solutions, especially in high dimensions.
problem CP degeneracy in tensor regression.
method Analysis of CP degeneracy and development of a penalized strategy.
result A general penalized strategy to overcome CP degeneracy in tensor regression.
Note removes degeneracy in Kähler geometry estimates.
problem Estimating diameter and inequalities in Kähler geometry with degeneracy.
method Technical improvement of earlier results.
result Established diameter, Green's functions, and Sobolev inequalities without small degeneracy assumption.
Counterfactual learning is a natural scenario to improve web-based machine translation services by offline learning from feedback logged during user interactions. In order to avoid the risk of showing inferior translations to users, in such scenarios mostly exploration-free deterministic logging policies are in place. …
A semisimplicial set has face maps but not degeneracies. A basic fact, due to Rourke and Sanderson, is that a semisimplicial set satisfying the Kan condition can be given a simplicial structure. The present paper gives a combinatorial proof of this fact and a generalization to multisemisimplicial sets.
TAMD prevents degeneracy in finite mixtures, offering strong guarantees but modest practical improvements.
problem Degeneracy in maximum likelihood estimation of finite mixtures.
method Transcendental regularization with analytic barrier functions.
result Strong theoretical guarantees (identifiability, consistency, robustness) but modest practical improvements.
We analyze relations between BPS degeneracies related to Labastida-Marino-Ooguri-Vafa (LMOV) invariants, and algebraic curves associated to knots. We introduce a new class of such curves that we call extremal A-polynomials, discuss their special properties, and determine exact and asymptotic formulas for the correspond…
The paper addresses rigid alignment of noisy patches, providing a polynomial time algorithm and convergence conditions.
problem Finding a rigid alignment of overlapping local views (patches) that minimizes alignment error in a noisy setting.
method Characterizes non-degeneracy based on kernel and positivity of a matrix, provides polynomial time algorithm for testing non-degeneracy, and uses Riemannian gradient descent for alignment.
result The algorithm converges locally linearly to a non-degenerate perfect alignment under certain conditions.
New cylindrical solutions found for Grushin-type problem.
problem Critical Grushin-type problem on CR sphere.
method Local Pohozaev identities for non-degeneracy, Lyapunov-Schmidt reduction for solutions.
result New type of multi-bubbling cylindrical solutions constructed.
Local bifurcation theory typically deals with the response of a degenerate but isolated equilibrium state or periodic orbit of a dynamical system to perturbations controlled by one or more independent parameters, and characteristically uses tools from singularity theory. There are many situations, however, in which the…
Two flexible, degenerate constructions related to Thurston's theorem.
problem Understanding the structure and local non-rigidity of Teichmüller spaces and their representations.
method Constructing geodesic segments and open sets in Teichmüller spaces with specific properties.
result Geodesic segments and open sets with degenerate properties in Teichmüller spaces.
New models exploit invariance to reduce model complexity.
problem Reducing model complexity for tasks with inherent invariances.
method Invariant random features and kernel methods.
result Exploiting invariance saves a dα factor in model complexity. This paper provides a set of sensitivity analysis and activity identification results for a class of convex functions with a strong geometric structure, that we coined "mirror-stratifiable". These functions are such that there is a bijection between a primal and a dual stratification of the space into partitioning sets…
Study non-degeneracy of minimal hypersurfaces asymptotic to cones, proving Jacobi equation solvability.
problem Non-degeneracy properties of minimal hypersurfaces asymptotic to cones.
method Analysis of the Jacobi operator and construction of its right inverse.
result Proved solvability of the Jacobi equation under non-degeneracy assumptions.
Study families of Morse functions for manifolds with boundary.
problem Characterize degeneracies in 1-parameter families of Morse functions.
method List all possible degeneracies in generic 1-parameter families.
result Identified all degeneracies in generic 1-parameter families.
We prove a holomorphic residue localization formula for odd holomorphic vector fields on compact complex supermanifolds whose fermionic and bosonic dimensions coincide. Under isolated non-degeneracy hypotheses on the reduced zero set, we give an explicit local residue formula.
New lower bounds for linear classification problems in high dimensions.
problem Linear classification problems in high-dimensional spaces.
method Reduction from hardness conjectures for Affine Degeneracy testing and k-Sum problems.
result Matching lower bounds of Ω(n^d) and respectively Ω(1/ε^d) for Maximum Halfspace Discrepancy problem.
The spectral properties of p-forms on the fundamental domains of regular tesselations of the d-dimensional sphere are discussed. The degeneracies for all ranks, p, are organised into a double Poincare series which is explicitly determined. In the particular case of coexact forms of rank (d-1)/2, for odd d, it is shown …
A method to automatically and symbolically detect and resolve degenerate parameter combinations from parameter-data pairs.
problem Identifying degenerate parameter combinations in physical models or real-world datasets.
method The degeneracy distillery method detects and resolves degenerate parameter combinations from parameter-data pairs.
result The method reduces the simulation budget required for downstream neural posterior estimation.
DFA trains deep networks by aligning weights then memorizing data.
problem Understanding why DFA works for some networks but not others.
method Two-step learning process: alignment followed by memorization.
result DFA aligns weights to maximize gradient alignment, breaking degeneracy.
We extend Kac-Rice formula to compute expected intersections of random submanifolds.
problem Computing expected intersections of random submanifolds.
method Generalized Kac-Rice formula using measure theory and integration.
result Formula computes expected cardinality of preimages of submanifolds via random maps.
The paper develops Morse homology for a class of elliptic partial differential equations.
problem Developing Morse homology for elliptic partial differential equations.
method Introducing a new notion of non-degeneracy and proving it generically satisfied for a class of functionals defined on Banach spaces.
result The paper enlarges the class of elliptic pde's for which non-degeneracy holds and Morse homology can be defined.
Improved estimation of higher order integrals using shrinkage techniques.
problem Estimating higher order Bochner integrals in non-parametric settings.
method Shrinkage of U-statistic towards a target element, considering kernel degeneracy.
result Consistent shrinkage estimators with fast rates of convergence, even for non-degenerate kernels.
Study on automorphisms of complex bk-manifolds, extending previous work.
problem Investigate automorphisms of complex bk-manifolds with higher-order degeneracies. method Extend Mendoza's definition of complex b-manifolds to complex bk-manifolds and study their local and global automorphisms. result Propose bk-analogues for classical spaces of holomorphic functions. A training-free method for conditional sampling using flow matching.
problem Weight degeneracy in high-dimensional importance sampling.
method Sequential Monte Carlo with resampling and stochastic flow.
result Significantly outperforms existing methods on MNIST and CIFAR-10.
Generalizing some results from R. Leung's thesis, we compute, in rational cohomology, the Poincare dual of the degeneracy locus of the family of Dirac operators parameterized by the moduli space of projectively anti-self-dual $\SO(3)$ connections. This is the first step in a program to derive a relation between the Don…
Study on existence of p-Kähler structures on nilmanifolds with nilpotent complex structures.
problem Existence of p-Kähler structures on nilmanifolds with nilpotent complex structures. method Determine optimal p for existence of p-Kähler structures and analyze the relationship between balanced metrics and degeneracy steps of the Frölicher spectral sequence. result No p-Kähler structures exist for an optimal p on nilmanifolds with nilpotent complex structures. Proves existence of proper solutions for inverse mean curvature flow.
problem Existence of proper solutions for inverse mean curvature flow.
method Proves existence theorem assuming non-degeneracy conditions on isoperimetric profile.
result No curvature assumption in existence theorem.
Random Matrix Theory explains loss surface Hessians in neural networks.
problem Understanding the loss surfaces of neural networks.
method Investigation of local spectral statistics of neural network Hessians.
result Excellent agreement with Gaussian Orthogonal Ensemble statistics.
Study ratio-limit boundaries for random walks on hyperbolic groups.
problem Computing ratio-limit boundaries for relatively hyperbolic groups.
method Adapting Woess's strategy to non-hyperbolic groups and analyzing degenerate cases.
result Closure of minimal points in R-Martin boundary is the unique smallest invariant subspace in ratio-limit boundary. Wide deep neural networks with Gaussian weights approximate Gaussian processes closely.
problem Understanding the approximation of deep neural networks with Gaussian weights to Gaussian processes.
method Established novel rates for the Gaussian approximation of random deep neural networks with Gaussian parameters and Lipschitz activation functions in the wide limit.
result The distance between the network output and the Gaussian approximation scales inversely with the width of the network.
Unified Morse-Bott-Smale chain complex, resolves well-definedness issue.
problem Well-definedness of Morse-Bott-Smale chain complex.
method Unified five degeneracy relations into a single condition.
result Quasi-isomorphic to Morse-Smale-Witten chain complex, alternative proof of Morse Homology Theorem.
MaxCOSD algorithm tackles non-i.i.d. demands and stateful dynamics in online inventory control.
problem Managing inventory with non-i.i.d. demands and stateful dynamics.
method MaxCOSD, an online algorithm with provable guarantees for non-degeneracy assumptions.
result MaxCOSD achieves optimal performance for non-i.i.d. demands and stateful dynamics.