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.
Max-affine regression method converges linearly using GD and SGD.
problem Regression of max-affine models in signal processing and statistics.
method Gradient descent and mini-batch stochastic gradient descent analysis.
result GD and SGD converge linearly to a neighborhood of the ground truth under sub-Gaussian assumptions.
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.
We extend the Faltings modular heights of abelian varieties to general arithmetic varieties and show direct relations with the Kahler-Einstein geometry, the Minimal Model Program, heights of Bost and Zhang, and give some applications. Along the way, we propose arithmetic Yau-Tian-Donaldson conjecture, an equivalence of…
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.
Tropical geometry and weighted lattices improve curve and surface fitting.
problem Fitting max-⋆ tropical curves and surfaces to data. method Max-⋆ algebra, weighted lattices, morphological adjunctions. result Optimal piecewise-linear regression for max-⋆ curves and surfaces. 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…
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 …
Paper proposes Sp-GD for sparse max-affine regression with theoretical guarantees.
problem Sparse max-affine regression model selection and estimation.
method Sparse Gradient Descent (Sp-GD) initialization using sparse PCA and covering search.
result Sp-GD provides ε-accurate estimates with optimal number of observations.
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 L∞-norm and Lebesgue integrable functions under Lp-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…
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…
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…
Mathematicians prove a conjecture about mirror symmetry at genus one.
problem Extending mirror symmetry to higher genera and proving the BCOV conjecture.
method Arithmetic Riemann-Roch theorem and previous results on BCOV invariant.
result Established the BCOV conjecture for Calabi-Yau hypersurfaces in projective spaces.
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. …
Max-affine regression refers to a model where the unknown regression function is modeled as a maximum of k unknown affine functions for a fixed k≥1. This generalizes linear regression and (real) phase retrieval, and is closely related to convex regression. Working within a non-asymptotic framework, we study th…
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.…
Faces of quasi-arithmetic Coxeter polytopes are also quasi-arithmetic.
problem Characterizing faces of quasi-arithmetic Coxeter polytopes.
method Proof of quasi-arithmetic property of faces and sufficient condition for arithmetic faces.
result Lower-dimensional faces of quasi-arithmetic Coxeter polytopes are quasi-arithmetic.
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…
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.
Course on arithmetic lattices at EPFL.
problem Understanding arithmetic lattices.
method Introductory course on arithmetic lattices.
result Introduction to arithmetic lattices.
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.
Paper shows non-arithmetic surface with unique geometric property.
problem Non-arithmetic surfaces with unique geometric properties.
method Example of a non-arithmetic surface with marked length variety rigidity.
result Found a non-arithmetic surface with marked length variety rigidity.
New classification of hyperbolic Coxeter prisms.
problem Classifying hyperbolic Coxeter prisms.
method Determine which prisms are quasi-arithmetic or arithmetic.
result New insights into commensurability and systoles of associated orbifolds.
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…
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…
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…
Geodesics on modular surface yield arithmetic 3-manifolds.
problem Understanding arithmetic properties of modular surfaces.
method Constructing geodesics and analyzing their lifts.
result Complements of canonical lifts are arithmetic 3-manifolds.
New property identifies arithmetic lattices from nonuniform lattices.
problem Characterizing arithmetic lattices among nonuniform lattices.
method Introduced Bounded Clustering (B-C) property.
result B-C property uniquely identifies arithmetic lattices.
New proof shows maximal arithmetic groups are finite.
problem Finiteness of maximal arithmetic reflection groups.
method Arithmetic Margulis lemma without automorphic forms.
result Finiteness of maximal arithmetic reflection groups proven.
Develops arithmetic PDE geometry using Fermat quotients.
problem Creating an arithmetic PDE analogue of Riemannian geometry.
method Using Fermat quotients and Frobenius elements in the absolute Galois group of a p-adic field. result Existence and uniqueness of geodesics and connections proved.
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).
Study general hyperbolic gluings, proving quasi-arithmeticity of building blocks.
problem Proving quasi-arithmeticity of building blocks in hyperbolic gluings.
method Generalized gluings of hyperbolic orbifolds, proving quasi-arithmeticity.
result Building blocks of quasi-arithmetic gluings must also be quasi-arithmetic.
The study of systoles in arithmetic hyperbolic manifolds.
problem Understanding the systoles of arithmetic hyperbolic manifolds.
method Construction and analysis of arithmetic hyperbolic manifolds.
result Explicit bounds on volumes and systoles of arithmetic hyperbolic manifolds.
We explore hybrid subgroups of certain non-arithmetic lattices in 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).
New research shows certain arithmetic lattices can't be LERF.
problem Determining if arithmetic lattices are LERF.
method Analyzing trialitarian arithmetic lattices in PSO7,1(R). result Trialitarian arithmetic lattices in PSO7,1(R) are not LERF. Arithmetic spaces' thin parts are negligible, impacting Betti numbers.
problem Understanding the structure of arithmetic locally symmetric spaces.
method Analyzing thin parts and deducing asymptotic results on Betti numbers.
result Arithmetic spaces' thin parts are negligible, impacting Betti numbers.
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…
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.