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.

169,051 papers · 148 categories

Trend · papers per month

6.3%12.5%18.8%25.0% · Mar 199319922001200920172026
48 results for approximate vanishing ideals

Paper tackles spurious vanishing problem in approximate vanishing ideals.

problem Capturing nonlinear structure of perturbed data points leads to spurious vanishing problem.
method Proposes a general method integrating coefficient normalization and iterative basis construction.
result Proposed method overcomes spurious vanishing problem, resulting in shorter feature vectors.

The vanishing ideal is a set of polynomials that takes zero value on the given data points. Originally proposed in computer algebra, the vanishing ideal has been recently exploited for extracting the nonlinear structures of data in many applications. To avoid overfitting to noisy data, the polynomials are often designe…

2018-01-29abs ↗pdf ↗

Gradient boosts monomial-order-free basis construction algorithms.

problem Lack of theoretical properties in monomial-order-free basis construction algorithms.
method Exploits gradient to sidestep spurious vanishing, achieve consistent output, and remove redundant bases.
result Proposes methods that equip monomial-order-free algorithms with theoretical properties.

The paper proves injectivity and vanishing theorems on compact Kahler manifolds.

problem Injectivity and vanishing theorems on compact Kahler manifolds.
method Hodge theory, Bochner-Kodaira-Nakano identity, analytic method, transcendental method, Demailly-Peternell-Schneider equisingular approximation theorem, Hormander L2 estimates.
result The main injectivity theorem implies several Nadel type vanishing theorems.

In this expository article we first give an overview on multiplier ideal sheaves and geometric problems in Kählerian and Sasakian geometries. Then we review our recent results on the relationship between the support of the subschemes cut out by multiplier ideal sheaves and the invariant whose non-vanishing obstructs th…

2009-10-20abs ↗pdf ↗

In this paper we define the adjoint Reidemeister torsion as a differential form on the character variety of a compact oriented 3-manifold with toral boundary, and prove it defines a regular volume form. Then we show that the torsion form can vanish only at singular points of the character variety. In fact, if the singu…

2016-12-19abs ↗pdf ↗

We define the ideal simplicial volume for compact manifolds with boundary. Roughly speaking, the ideal simplicial volume of a manifold MM measures the minimal size of possibly ideal triangulations of MM "with real coefficients", thus providing a variation of the ordinary simplicial volume defined by Gromov in 1982, t…

2018-02-14abs ↗pdf ↗

We consider the ideal-gas models of trading markets, where each agent is identified with a gas molecule and each trading as an elastic or money-conserving (two-body) collision. Unlike in the ideal gas, we introduce saving propensity λλ of agents, such that each agent saves a fraction λλ of its money and trades with t…

2003-02-07abs ↗pdf ↗

We propose a method called ideal regression for approximating an arbitrary system of polynomial equations by a system of a particular type. Using techniques from approximate computational algebraic geometry, we show how we can solve ideal regression directly without resorting to numerical optimization. Ideal regression…

2011-10-20abs ↗pdf ↗

Software finds ideal polyhedra with rational dihedral angles and volume maxima.

problem Finding ideal convex polyhedra with maximal volume in hyperbolic 3-space.
method Rivin's variational characterization and combinatorial optimization algorithms.
result Maximal volume ideal polyhedra have dihedral angles that are rational multiples of π.

New quantum invariant for framed 3-manifolds using ideal triangulations.

problem Quantum invariants of framed 3-manifolds with vanishing first Betti number.
method Based on ideal triangulations and Hopf algebras, using the pentagon equation and graphical representations.
result Construction of a new quantum invariant for closed framed 3-manifolds.

We describe how cross-kernel matrices, that is, kernel matrices between the data and a custom chosen set of `feature spanning points' can be used for learning. The main potential of cross-kernels lies in the fact that (a) only one side of the matrix scales with the number of data points, and (b) cross-kernels, as oppos…

2014-06-10abs ↗pdf ↗

We consider the ideal-gas models of trading markets, where each agent is identified with a gas molecule and each trading as an elastic or money-conserving (two-body) collision. Unlike in the ideal gas, we introduce saving propensity λλ of agents, such that each agent saves a fraction λλ of its money and trades with t…

2003-11-11abs ↗pdf ↗

The ``classical BRST construction'' as developed by Batalin-Fradkin-Vilkovisky is a homological construction for the reduction of the Poisson algebra P=C(W)P = C^\infty (W) of smooth functions on a Poisson manifold WW by the ideal II of functions which vanish on a constraint locus. This ideal is called first class if II

1996-03-24abs ↗pdf ↗

The paper establishes conditions for Riemannian connections and semi-simplicity of Lie algebras using spray structures.

problem Conditions for Riemannian connections and semi-simplicity of Lie algebras.
method Using almost product structures and spray, the paper provides necessary and sufficient conditions for these properties.
result Equivalence of semi-simplicity of Lie algebras to derived ideal coincidence, interiority of derivations, and adjoint representation semi-simplicity.

Optimizes a small set of centroid points to approximate bootstrap distribution.

problem Computational inefficiency of standard bootstrap methods in large-scale machine learning.
method Explicitly optimizes a small set of high quality centroid points to approximate the ideal bootstrap distribution.
result Accurately estimates uncertainty with a small number of bootstrap centroids, outperforming i.i.d. sampling.

Paper introduces a neural network training algorithm for noisy data that achieves optimal parameters and replicates real-world behaviors.

problem Theoretical gap between universal approximation theorems and practical machine learning with noisy data.
method Randomized training algorithm for neural networks trained on noisy data samples.
result Trained neural networks achieve optimal parameters and exhibit real-world behaviors like sub-linear complexity and interpolation.

In this paper, we study generalized constant ratio (GCR) hypersurfaces in Euclidean spaces. We mainly focus on the hypersurfaces in E4\mathbb E^4. First, we deal with δ(2)δ(2)-ideal GCR hypersurfaces. Then, we study on hypersurfaces with constant (first) mean curvature. Finally, we obtain the complete classification of G…

2015-04-29abs ↗pdf ↗

This research uses machine learning to approximate ideal and hotelling observer performance for binary signal detection.

problem Approximating the Ideal and Hotelling Observers for binary signal detection tasks.
method Supervised learning methods, including CNNs and SLNNs, are employed to approximate the IO and HO test statistics.
result The proposed supervised learning methods provide accurate approximations of the IO and HO test statistics.

We prove the ADO invariants are a q-holonomic family and establish recursion relations.

problem Understanding the qq-holonomic properties of ADO link invariants.
method Proving the ADO invariants are a qq-holonomic family and establishing recursion relations.
result The ADO invariants for r2r\geq 2 are a qq-holonomic family, satisfying independent recursion relations.

Paper explores supervised learning methods to approximate ideal observer for joint signal detection and localization.

problem Optimizing medical imaging systems by assessing their performance using the Ideal Observer model.
method Uses supervised learning methods, specifically convolutional neural networks, to approximate the Ideal Observer for joint signal detection and localization tasks.
result Supervised learning-based methods can approximate the Ideal Observer for joint signal detection and localization tasks, as shown by comparisons to MCMC and analytical methods.

Study curvatures of submanifolds in space forms with topological obstructions.

problem Investigate intrinsic curvatures and their implications for submanifolds in space forms.
method Derive inequalities involving mean curvature and normal scalar curvature, derive topological obstructions.
result Prove existence of compact 3-dimensional minimal Wintgen ideal submanifolds in even-dimensional spheres.

Expectation propagation (EP) is a deterministic approximation algorithm that is often used to perform approximate Bayesian parameter learning. EP approximates the full intractable posterior distribution through a set of local approximations that are iteratively refined for each datapoint. EP can offer analytic and comp…

2015-06-12abs ↗pdf ↗

Derives ideal train/test split for ridge regression in large data limit.

problem Finding optimal train/test split for ridge regression in large data scenarios.
method Mathematical derivation of optimal train/test split, considering ridge tuning parameter and asymptotic behavior.
result The optimal train/test split for ridge regression in the large data limit depends weakly on the ridge tuning parameter alpha.

The study explores Einstein hypersurfaces in warped product spaces and their properties.

problem Investigating Einstein hypersurfaces in warped product spaces.
method Analyzing constant curvature hypersurfaces and properties of gradient functions.
result Characterization of ideal Einstein hypersurfaces with specific curvature properties.

We present explicit geometric decompositions of the complement of tiling links, which are alternating links whose projection graphs are uniform tilings of the 2-sphere, the Euclidean plane or the hyperbolic plane. This requires generalizing the angle structures program of Casson and Rivin for triangulations with a mixt…

2016-03-11abs ↗pdf ↗

Study convexity of Mabuchi functional in big cohomology classes.

problem Convexity of Mabuchi functional in big cohomology classes.
method Defined an invariant related to transcendental Fujita approximations and established convexity under vanishing of this invariant.
result Established almost convexity along weak geodesics in big cohomology classes.

The Weil-Petersson metric's curvature vanishes for surfaces with short geodesics.

problem Understanding the vanishing rate of Weil-Petersson sectional curvatures.
method Analyzing the moduli space of Riemann surfaces, bounding curvature, and using product metrics.
result Bounding the sectional curvature away from zero in terms of geodesic lengths.

Deep learning networks are approximated using dynamical systems theory.

problem Understanding the approximation capabilities of deep learning networks.
method Modeling deep residual networks as continuous-time dynamical systems and using approximation theories in LpL^p.
result Established general sufficient conditions for universal approximation of deep residual networks.