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

156312467623 · Jun 202019922001200920172026
48 results for discrete computations

Neural networks learn discrete tasks on continuous data via emergent geometry.

problem Understanding how neural networks perform discrete computations on continuous data.
method Analysis of Riemannian pullback metric across neural network layers.
result Neural networks learn to discretize continuous inputs and perform logical operations on these discretized variables.

The present chapter gives an overview on results for discrete knot energies. These discrete energies are designed to make swift numerical computations and thus open the field to computational methods. Additionally, they provide an independent, geometrically pleasing and consistent discrete model that behaves similarly …

2016-03-08abs ↗pdf ↗

Develops a new Bayesian inference method for discrete data.

problem Computational challenges in discrete state spaces, especially intractable likelihoods.
method Uses a discrete Fisher divergence to update beliefs about model parameters, circumventing the intractable normalising constant.
result Establishes statistical properties of the generalised posterior and proposes a calibration approach.

We extend the Fourier cosine method to discrete probability distributions, achieving faster convergence rates.

problem Extending Fourier cosine method to discrete probability distributions.
method Spectral filters and convergence rates analysis.
result Spectral filters achieve one order faster convergence rates than previously recognized.

Paper tackles decidability of subgroup discreteness problem.

problem Decidability of finitely generated subgroup discreteness in PSL(2,R)PSL(2,\mathbb{R}) and PSL(2,C)PSL(2,\mathbb{C}).
method Examines different computational models to determine if the discreteness problem is decidable.
result The answer depends on the model of computation chosen.

We present effective methods to compute equivariant harmonic maps from the universal cover of a surface into a nonpositively curved space. By discretizing the theory appropriately, we show that the energy functional is strongly convex and derive convergence of the discrete heat flow to the energy minimizer, with explic…

2018-10-29abs ↗pdf ↗

A few years ago Kramer and Laubenbacher introduced a discrete notion of homotopy for simplicial complexes. In this paper, we compute the discrete fundamental group of the order complex of the Boolean lattice. As it turns out, it is equivalent to computing the discrete homotopy group of the 1-skeleton of the permutahedr…

2007-11-06abs ↗pdf ↗

In the previous paper [GLM2018], we showed that the theory of harmonic maps between Riemannian manifolds may be discretized by introducing triangulations with vertex and edge weights on the domain manifold. In the present paper, we study convergence of the discrete theory to the smooth theory when taking finer and fine…

2019-10-17abs ↗pdf ↗

A new discrete calculus for bundle-valued forms is proposed and validated.

problem Discretization of exterior calculus for bundle-valued forms.
method Discretization of Cartan's exterior calculus for differential forms with values in vector bundles.
result The proposed discrete operator mimics the continuous exterior covariant derivative and ensures numerical convergence.

A simpler edge-based discretization method without dual volumes.

problem Efficiently computing edge-based discretization vectors without forming dual volumes.
method Directly compute edge-midpoint vectors and reduce dual volume formation.
result Significant reduction in computing time for tetrahedral grids.

A new method for computing image curvature efficiently and accurately.

problem Low performance, low accuracy, and requirement of second order differentiability in conventional computation schemes.
method Proposes a novel discrete computation scheme for weighted Gaussian curvature.
result More accurate, computationally more efficient, and does not require second order differentiability.

A discrete conformality for hyperbolic polyhedral surfaces is introduced in this paper. This discrete conformality is shown to be computable. It is proved that each hyperbolic polyhedral metric on a closed surface is discrete conformal to a unique hyperbolic polyhedral metric with a given discrete curvature satisfying …

2014-01-18abs ↗pdf ↗

1) We introduce random discrete Morse theory as a computational scheme to measure the complicatedness of a triangulation. The idea is to try to quantify the frequence of discrete Morse matchings with a certain number of critical cells. Our measure will depend on the topology of the space, but also on how nicely the spa…

2013-03-26abs ↗pdf ↗

Novel framework combines tree-based discretization and ILP matching for causal inference.

problem Challenges in identifying causal relationships from observational data.
method Combines tree-based discretization and ILP matching for causal inference.
result Yields computational efficiency and less biased ATT estimates.

Discrete Morse theory emerged as an essential tool for computational geometry and topology. Its core structures are discrete gradient fields, defined as acyclic matchings on a complex CC, from which topological and geometrical informations of CC can be efficiently computed, in particular its homology or Morse-Smale d…

2018-01-30abs ↗pdf ↗

Corrected samplers reduce discretization error in discrete flow models without additional computational cost.

problem Discretization error in samplers for discrete flow models.
method Established non-asymptotic error bounds for samplers, proposed time-corrected and location-corrected samplers.
result Location-corrected sampler has lower complexity and better generation quality.

Discrete vector bundles are important in Physics and recently found remarkable applications in Computer Graphics. This article approaches discrete bundles from the viewpoint of Discrete Differential Geometry, including a complete classification of discrete vector bundles over finite simplicial complexes. In particular,…

2015-06-25abs ↗pdf ↗

Exact Bayesian inference for discrete models using probability generating functions.

problem Discrete statistical models with infinite support and continuous priors.
method Probabilistic programming language with automatic differentiation and probability generating functions.
result Genfer tool provides exact solutions for a wide range of inference problems.

We develop a geometric version of the inverse problem of the calculus of variations for discrete mechanics and constrained discrete mechanics. The geometric approach consists of using suitable Lagrangian and isotropic submanifolds. We also provide a transition between the discrete and the continuous problems and propos…

2017-08-14abs ↗pdf ↗

On the basis of loop group decompositions (Birkhoff decompositions), we give a discrete version of the nonlinear d'Alembert formula, a method of separation of variables of difference equations, for discrete constant negative Gauss curvature (pseudospherical) surfaces in Euclidean three space. We also compute two exampl…

2015-05-27abs ↗pdf ↗

Connections on principal bundles play a fundamental role in expressing the equations of motion for mechanical systems with symmetry in an intrinsic fashion. A discrete theory of connections on principal bundles is constructed by introducing the discrete analogue of the Atiyah sequence, with a connection corresponding t…

2005-08-18abs ↗pdf ↗

Proves hardness of semi-discrete optimal transport and proposes regularization methods.

problem Computing Wasserstein distance between discrete and non-discrete probability measures.
method Proves hardness, introduces distributionally robust dual optimal transport, regularizes primal objective, uses stochastic gradient descent.
result Regularization schemes and improved convergence guarantees for semi-discrete optimal transport problems.

We describe algorithms for finding harmonic cochains, an essential ingredient for solving elliptic partial differential equations in exterior calculus. Harmonic cochains are also useful in computational topology and computer graphics. We focus on finding harmonic cochains cohomologous to a given cocycle. Amongst other …

2010-12-13abs ↗pdf ↗

While normalizing flows have led to significant advances in modeling high-dimensional continuous distributions, their applicability to discrete distributions remains unknown. In this paper, we show that flows can in fact be extended to discrete events---and under a simple change-of-variables formula not requiring log-d…

2019-05-24abs ↗pdf ↗

This text explores strategies for learning discrete latent structures in neural networks.

problem Learning discrete latent structures in neural networks is challenging.
method Continuous relaxation, surrogate gradients, and probabilistic estimation.
result Many latent structure learning strategies use the same fundamental building blocks but apply them differently.

We study how the round-off (or discretization) error changes the statistical properties of a Gaussian long memory process. We show that the autocovariance and the spectral density of the discretized process are asymptotically rescaled by a factor smaller than one, and we compute exactly this scaling factor. Consequentl…

2011-07-22abs ↗pdf ↗

This paper considers the computational power of constant size, dynamic Bayesian networks. Although discrete dynamic Bayesian networks are no more powerful than hidden Markov models, dynamic Bayesian networks with continuous random variables and discrete children of continuous parents are capable of performing Turing-co…

2016-03-19abs ↗pdf ↗

Introduces flat discrete signatures for financial data analysis.

problem Representing financial data for machine learning without continuous transformation.
method Introduced flat discrete signatures and discrete signatures, generalizing flat discrete signatures.
result Flat discrete signatures can represent quadratic variation relevant in finance.

Bayesian inference of discrete component states in civil infrastructures using PGMs and GNNs.

problem Inferring discrete states of civil infrastructure components from measurable responses is an ill-posed inverse problem.
method The study proposes a novel Bayesian inversion paradigm based on Probabilistic Graphical Models (PGMs) and Graph Neural Networks (GNNs). PGMs are used to model the problem, with parameters learned from data and structural topology prior. Inference is accomplished by GNNs, and a graph property-based training strategy is developed.
result The proposed framework effectively solves the challenges of inferring the posterior PDF for discrete variables in high-dimensional problems.

We consider a numerical approach for the incompressible surface Navier-Stokes equation. The approach is based on the covariant form and uses discrete exterior calculus (DEC) in space and a semi-implicit discretization in time. The discretization is described in detail and related to finite difference schemes on stagger…

2016-11-14abs ↗pdf ↗