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

24487195 · Jun 202619922001200920172026
48 results for proof simplification

We give a proof that the geometric K-homology theory for finite CW-complexes defined by Baum and Douglas is isomorphic to Kasparov's K-homology. The proof is a simplification of more elaborate arguments which deal with the geometric formulation of equivariant K-homology theory.

2007-01-17abs ↗pdf ↗

This is an exposition of a proof of the Madsen-Weiss Theorem, which asserts that the homology of mapping class groups of surfaces, in a stable dimension range, is isomorphic to the homology of a certain infinite loopspace that arises naturally when one applies the "scanning method". The proof given here utilizes simpli…

2011-03-27abs ↗pdf ↗

By a theorem of Greene and Wu, a noncompact connected Riemannian manifold admits a smooth strictly subharmonic exhaustion function. Demailly provided an elementary proof of this fact. A further simplification of Demailly's proof and some (mostly known) applications are described. Applications include the fact that the …

2004-05-27abs ↗pdf ↗

This paper is purely expositional. The statement of the Kuratowski graph planarity criterion is simple and well-known. However, its classical proof is not easy. In this paper we present the Makarychev proof (with further simplifications by Prasolov, Telishev, Zaslavski and the author) which is possibly the simplest. In…

2008-02-26abs ↗pdf ↗

Simplified proof and new C0C^0 estimate for Kähler-Einstein metrics.

problem Existence of Kähler-Einstein metrics on Calabi-Yau manifolds.
method Alternative C0C^0 a priori estimate for the Monge-Ampère equation.
result Established a new uniform bound for the solution of the Monge-Ampère equation.

We give a simple proof of Lee's result from [Adv. Math. 179 (2005) 554-586; arXiv:math.GT/0210213], that the dimension of the Lee variant of the Khovanov homology of a c-component link is 2^c, regardless of the number of crossings. Our method of proof is entirely local and hence we can state a Lee-type theorem for tang…

2006-06-21abs ↗pdf ↗

This note has an experimental nature and contains no new theorems. We introduce certain moves for classical knot diagrams that for all the very many examples we have tested them on give a monotonic complete simplification. A complete simplification of a knot diagram D is a sequence of moves that transform D into a diag…

2015-08-13abs ↗pdf ↗

We establish a full hh-principle (C0C^0-close, relative, parametric) for the simplification of singularities of Lagrangian and Legendrian fronts. More precisely, we prove that if there is no homotopy theoretic obstruction to simplifying the singularities of tangency of a Lagrangian or Legendrian submanifold with respe…

2016-05-24abs ↗pdf ↗

Study shows convergence of anticanonically balanced metrics to Kähler-Einstein metrics on Fano manifolds.

problem Finding anticanonically balanced metrics on Fano manifolds.
method Simplification of Donaldson's proof using Berezin-Toeplitz quantization.
result Sequence of anticanonically balanced metrics converges to Kähler-Einstein metric.

Natural gradient simplification for deep learning networks.

problem Efficiency in training deep Bayesian networks.
method Analysis of two geometries of Fisher information matrix and development of a method to simplify natural gradient for the second geometry.
result A method to simplify natural gradient for deep networks using an auxiliary recognition model.

In this paper, we describe a canopolis (i.e. categorified planar algebra) formalism for Khovanov and Rozansky's link homology theory. We show how this allows us to organize simplifications in the matrix factorizations appearing in their theory. In particular, it will put the equivalence of the original definition of Kh…

2006-10-23abs ↗pdf ↗

A new KAN variant uses sinusoidal activations to approximate functions.

problem Approximating multivariable functions using neural networks.
method Replacing inner and outer functions in Kolmogorov-Arnold representation with weighted sinusoidal functions.
result The new KAN variant outperforms fixed-frequency Fourier transform and achieves comparable performance to MLPs.

We describe ASAGA, an asynchronous parallel version of the incremental gradient algorithm SAGA that enjoys fast linear convergence rates. Through a novel perspective, we revisit and clarify a subtle but important technical issue present in a large fraction of the recent convergence rate proofs for asynchronous parallel…

2016-06-15abs ↗pdf ↗

We extend the Novikov Morse-type inequalities for closed 1-forms in 2 directions. First, we consider manifolds with boundary. Second, we allow a very degenerate structure of the critical set of the form, assuming only that the form is non-degenerated in the sense of Kirwan. In particular, we obtain a generalization of …

2004-03-26abs ↗pdf ↗

This paper simplifies deep ReLU networks into local linear models for better interpretability.

problem Limited transparency and interpretability of deep neural networks, especially ReLU networks.
method Local linear representation and equivalent set of local linear models (LLMs).
result Simplified deep ReLU networks for better interpretability and diagnostics.

Furuta's ``10/8-th's'' theorem gives a bound on the magnitude of the signature of a smooth spin 4-manifold in terms of the second Betti number. We show that in the presence of a Z/2^p action, his bound can be strengthened. As applications, we give new genus bounds on classes with divisibility and we give a classificati…

1997-04-22abs ↗pdf ↗

The second author previously discussed how classical complexity separation conjectures, we call them "axioms", have implications in three manifold topology: polynomial length stings of operations which preserve certain Jones polynomial evaluations cannot produce exponential simplifications of link diagrams. In this pap…

2013-05-26abs ↗pdf ↗

Proves simplicity of Lyapunov exponents for specific Anosov flows.

problem Proving all Lyapunov exponents have multiplicity 1 for certain Anosov flows.
method Perturbative results for flows, modification of eigenvalues, Markov partition, and simplicity criterion.
result In a C1C^1-open and CkC^k-dense set of Anosov flows, all Lyapunov exponents have multiplicity 1.

Two smooth manifolds M and N are called R-diffeomorphic if their product with the real line are diffeomorphic. We consider the following simplification problem: does R-diffeomorphism imply diffeomorphism or homeomorphism? For compact manifolds, analysis of this problem relies on some of the main achievements of the the…

2018-02-09abs ↗pdf ↗

Simplifies RF predictions by focusing on a subset of nearest neighbors.

problem Improving interpretability and performance of RF-based forecast distributions.
method Sparsifying RF-based forecast distributions by focusing on a small subset of nearest neighbors.
result Simplified RF predictions can be similar to or exceed original ones in forecasting performance.

Both classical and virtual knots arise as formal Gauss diagrams modulo some abstract moves corresponding to Reidemeister moves. If we forget about both over/under crossings structure and writhe numbers of knots modulo the same Reidemeister moves, we get a dramatic simplification of virtual knots, which kills all classi…

2009-02-01abs ↗pdf ↗

We give a new algorithm to simplify a given triangulation with respect to a given curve. The simplification uses flips together with powers of Dehn twists in order to complete in polynomial time in the bit-size of the curve.

2016-04-14abs ↗pdf ↗

Search-based methods for hard combinatorial optimization are often guided by heuristics. Tuning heuristics in various conditions and situations is often time-consuming. In this paper, we propose NeuRewriter that learns a policy to pick heuristics and rewrite the local components of the current solution to iteratively i…

2018-09-30abs ↗pdf ↗

The traditional Sznajd model, as well as its Ochrombel simplification for opinion spreading, are applied to marketing with the help of advertising. The larger the lattice is the smaller is the amount of advertising needed to convince the whole market

2002-07-06abs ↗pdf ↗

This is a survey of some of the recent developments in the theory of complex Monge-Ampere equations. The topics discussed include refinements and simplifications of classical a priori estimates, methods from pluripotential theory, variational methods for big cohomology classes, semiclassical constructions of solutions …

2012-09-11abs ↗pdf ↗

In this paper, we analyze the effects of depth and width on the quality of local minima, without strong over-parameterization and simplification assumptions in the literature. Without any simplification assumption, for deep nonlinear neural networks with the squared loss, we theoretically show that the quality of local…

2018-11-20abs ↗pdf ↗