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

Trend · papers per month

19395877 · Jun 202019922001200920172026
48 results for Max-Affine Arithmetic Programs

This paper shows neural networks can solve complex graph problems efficiently.

problem Solving exact maximum flow computation and minimum spanning tree problems.
method Introduces Max-Affine Arithmetic Programs and shows equivalence to neural networks.
result Two combinatorial optimization problems can be solved with polynomial-size neural networks.

Paper presents ABGD for efficient piecewise linear regression in high dimensions.

problem Efficiently solving piecewise linear regression in high-dimensional spaces.
method Parametrizes piecewise linear functions as difference of max-affine functions, using ABGD algorithm.
result ABGD converges linearly to an ε-accurate estimate with optimal sample complexity.

New AMP algorithm estimates signals and latent variables in mixed regression models.

problem Estimating signals and latent variables in mixed regression models.
method Approximate Message Passing (AMP) algorithm for matrix GLM.
result State evolution recursion and optimal denoising functions for precise error minimization.

New method uses DC functions for piecewise linear regression.

problem Regression with piecewise linear constraints.
method Estimates piecewise linear convex functions using a difference of convex functions.
result Method achieves close to minimax statistical risk and comparable performance to existing methods.

Paper presents an efficient algorithm for estimating Lipschitz functions from noisy data.

problem Estimating unknown Lipschitz functions from noisy observations.
method Extends max-affine methods to Lipschitz setting using nonlinear feature expansion and adaptive partitioning.
result Achieves minimax convergence rate with respect to intrinsic dimension, up to logarithmic factors.

Deep neural networks have achieved impressive supervised classification performance in many tasks including image recognition, speech recognition, and sequence to sequence learning. However, this success has not been translated to applications like question answering that may involve complex arithmetic and logic reason…

2015-11-16abs ↗pdf ↗

We classify all torsion-free derived arithmetic Fuchsian groups of genus two by commensurability class. In particular, we show that there exist no such groups arising from quaternion algebras over number fields of degree greater than 5. We also prove some results on the existence and form of maximal orders for a class …

2008-03-11abs ↗pdf ↗

New research disproves a key conjecture in optimization.

problem Comparison of sampling methods in stochastic optimization.
method Reduction to noncommutative arithmetic-geometric mean inequality and application of noncommutative Positivstellensatz.
result The Recht-Ré conjecture is false for general n.

Single-head attention approximates any function under various norms.

problem Universal approximation of functions using attention mechanisms.
method Interpreting attention as partitioning and summing linear transformations.
result Single-head attention can approximate any continuous function under LL_\infty-norm and Lebesgue integrable functions under LpL_p-norm.

We present DiffTaichi, a new differentiable programming language tailored for building high-performance differentiable physical simulators. Based on an imperative programming language, DiffTaichi generates gradients of simulation steps using source code transformations that preserve arithmetic intensity and parallelism…

2019-10-01abs ↗pdf ↗

This paper describes a general algorithm for finding the commensurator of a non-arithmetic cusped hyperbolic manifold, and for deciding when two such manifolds are commensurable. The method is based on some elementary observations regarding horosphere packings and canonical cell decompositions. For example, we use this…

2008-01-31abs ↗pdf ↗

Paper proposes algorithms for BMF using integer programming.

problem Approximating binary input matrix as product of two smaller binary factors.
method Alternating optimization strategy using integer programming to solve subproblems and combine solutions.
result Proposed algorithms outperform state of the art on medium-scale problems.

In this paper, we extend Deligne's functorial Riemann-Roch isomorphism for hermitian holomorphic line bundles on Riemann surfaces to the case of flat, not necessarily unitary connections. The Quillen metric and star-product of Gillet-Soule are replaced with complex valued logarithms. On the determinant of cohomology si…

2016-03-18abs ↗pdf ↗

We build a rigorous bridge between deep networks (DNs) and approximation theory via spline functions and operators. Our key result is that a large class of DNs can be written as a composition of max-affine spline operators (MASOs), which provide a powerful portal through which to view and analyze their inner workings. …

2018-05-17abs ↗pdf ↗

We investigate a question of Cooper adjacent to the Virtual Haken Conjecture. Assuming certain conjectures in number theory, we show that there exist hyperbolic rational homology 3-spheres with arbitrarily large injectivity radius. These examples come from a tower of abelian covers of an explicit arithmetic 3-manifold.…

2005-08-16abs ↗pdf ↗

In this article, we investigate when the set of primitive geodesic lengths on a Riemannian manifold have arbitrarily long arithmetic progressions. We prove that in the space of negatively curved metrics, a metric having such arithmetic progressions is quite rare. We introduce almost arithmetic progressions, a coarsific…

2014-01-29abs ↗pdf ↗

Develops arithmetic PDE geometry concepts like curvature and cohomology.

problem Creating a geometry framework for arithmetic PDEs.
method Introducing arithmetic analogues of Levi-Civita and Chern connections, then developing curvature and characteristic classes.
result Arithmetic analogues of curvature and characteristic classes have been developed.

New geometric invariant limits the number of semi-arithmetic groups.

problem Understanding the structure of semi-arithmetic Fuchsian groups.
method Introducing a new geometric invariant called stretch and using the arithmetic Margulis lemma.
result There exist only finitely many conjugacy classes of semi-arithmetic groups with bounded arithmetic dimension, stretch, and coarea.

The paper develops algorithms for Boolean matrix factorization using IP and heuristics.

problem Approximating binary input matrices as products of smaller binary factors.
method Alternating optimization with integer programming and greedy/local-search heuristics.
result Proposed methods improve scalability and performance compared to existing techniques.

Arithmetic Dijkgraaf-Witten theory constructs analogues in Chern-Simons TQFT.

problem Developing arithmetic analogues in Chern-Simons TQFT.
method Constructing arithmetic analogues of Chern-Simons 1-cocycle, prequantization bundle, and Chern-Simons functional.
result Decomposition and gluing formulas for arithmetic Chern-Simons invariants and arithmetic Dijkgraaf-Witten partition functions.

In this article, we prove that every arithmetic locally symmetric orbifold of classical type without Euclidean or compact factors has arbitrarily long arithmetic progressions in its primitive length spectrum. Moreover, we show the stronger property that every primitive length occurs in arbitrarily long arithmetic progr…

2016-02-04abs ↗pdf ↗

New method constructs non-arithmetic hyperbolic orbifolds from complex arithmetic ball quotients.

problem Creating non-arithmetic lattices in projective orthogonal groups.
method Using anti-holomorphic involutions on complex arithmetic ball quotients, gluing fixed loci along geodesic subspaces.
result Explicit calculation of the volume of constructed non-arithmetic orbifolds.

We show that the non-arithmetic lattices in PO(n,1) of Belolipetsky and Thomson (2011), obtained as fundamental groups of closed hyperbolic manifolds with short systole, are quasi-arithmetic in the sense of Vinberg, and, by contrast, the well-known non-arithmetic lattices of Gromov and Piatetski-Shapiro are not quasi-a…

2014-12-16abs ↗pdf ↗

The paper explores subspaces in hyperbolic lattices and their arithmetic properties.

problem Arithmeticity criterion for hyperbolic lattices and suborbifolds.
method Analysis of totally geodesic suborbifolds and Vinberg's commensurability invariants.
result Arithmeticity of hyperbolic orbifolds is linked to the existence of infinitely many fc-subspaces.

Define an arithmetic variety to be the quotient of a bounded symmetric domain by an arithmetic group. An arithmetic variety is algebraic, and the theorem in question states that when one applies an automorphism of the field of complex numbers to the coefficients of an arithmetic variety the resulting variety is again a…

2001-06-23abs ↗pdf ↗

We study the arithmeticity of the Couwenberg-Heckman-Looijenga lattices in PU(n,1), and show that they contain a non-arithmetic lattice in PU(3,1) which is not commensurable to the non-arithmetic Deligne-Mostow lattice in PU(3,1).

2017-10-12abs ↗pdf ↗

We explore hybrid subgroups of certain non-arithmetic lattices in PU(2,1)\mathrm{PU}(2,1). We show that all of Mostow's lattices are virtually hybrids; moreover, we show that some of these non-arithmetic lattices are hybrids of two non-commensurable arithmetic lattices in PU(1,1)\mathrm{PU}(1,1).

2019-05-29abs ↗pdf ↗

We apply G. Prasad's volume formula for the arithmetic quotients of semi-simple groups and Bruhat-Tits theory to study the covolumes of arithmetic subgroups of SO(1,n). As a result we prove that for any even dimension n there exists a unique compact arithmetic hyperbolic n-orbifold of the smallest volume. We give a for…

2003-06-30abs ↗pdf ↗

Efficiently prices American options with multiple assets using sparse grids.

problem Pricing American options with multiple underlying assets efficiently.
method Dynamic programming formulation followed by sparse grid interpolation.
result Sparse grids reduce the number of interpolation points and maintain function smoothness.

Develops Kleinian Sphere Packings and Bugs, proving their arithmetic origins.

problem Understanding sphere packings and their arithmetic origins in various dimensions.
method Introduces Kleinian Sphere Packings and Bugs, extending Arithmeticity Theorem.
result Kleinian packings and Bugs come from Q-arithmetic lattices of simplest type.