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

Trend · papers per month

139279418557 · May 202619922001200920172026
48 results for finite discrete values

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.

There is a need for the development of models that are able to account for discreteness in data, along with its time series properties and correlation. Our focus falls on INteger-valued AutoRegressive (INAR) type models. The INAR type models can be used in conjunction with existing model-based clustering techniques to …

2019-01-26abs ↗pdf ↗

We give a general formulation of the utility maximization problem under nondominated model uncertainty in discrete time and show that an optimal portfolio exists for any utility function that is bounded from above. In the unbounded case, integrability conditions are needed as nonexistence may arise even if the value fu…

2013-07-13abs ↗pdf ↗

The paper finds upper bounds for the continuous part of the axial distance spectrum for Kleinian groups.

problem Determining the upper bounds for the continuous part of the axial distance spectrum for Kleinian groups.
method Analyzing the geometric properties and distances between axes of elements of finite order in hyperbolic three-space.
result The gap between the continuous and discrete parts of the axial distance spectrum is surprisingly small, less than 1.4059.

Analytic submanifolds of cocycles reveal discrete cohomology spaces.

problem Analyzing cocycles and their coboundaries on Lie groups.
method Defining and studying cocycles as maps with specific properties, showing they form submanifolds and decomposing them into bundles.
result Cohomology spaces are discrete, with cocycles forming analytic submanifolds and their orbits open.

IDF++ improves integer discrete flows for lossless compression.

problem Theoretical limitations of integer discrete flows for lossless compression.
method Investigated and improved integer discrete flows, addressing gradient bias and architecture modifications.
result Different architecture modifications improve integer discrete flows for lossless compression.

The paper defines and studies discrete p-density and compression-radius profiles of lattice knots.

problem Understanding geometric properties of lattice knots.
method Develops a framework for discrete p-density and compression-radius profiles of lattice knots, studying them on length-filtered sets and finite move-graph exploration.
result Density and compression-radius values are not monotone, illustrating distinct optimization problems.

New boundary treatment improves accuracy for complex PDEs.

problem Order reduction in high-order IMEX schemes for multidimensional PDEs.
method Novel boundary treatment algorithms for Cartesian meshes, treating implicit-explicit stages similarly to interior points.
result Recovery of designed order of convergence by numerical verification.

New insights into RL efficiency from managing time discretization.

problem The impact of time discretization on RL methods in continuous-time systems.
method Analysis of Monte-Carlo policy evaluation for LQR systems.
result An optimal choice of temporal resolution for a given data budget improves policy evaluation efficiency.

We study time-consistency questions for processes of monetary risk measures that depend on bounded discrete-time processes describing the evolution of financial values. The time horizon can be finite or infinite. We call a process of monetary risk measures time-consistent if it assigns to a process of financial values …

2004-10-21abs ↗pdf ↗

Method infers causal structure from system behaviors using RKHS and kernel εε-machines.

problem Discovering causal structure in systems with varying external and measurement noise.
method Combines causal states and RKHS for efficient representation and inference of causal structure.
result Robustly estimates causal structure in high-dimensional data with varying noise.

New discrete-time model shows insider trading dynamics.

problem Modeling insider trading with discrete time and noise traders.
method Formulated as a game with three types of traders, including an insider, noise traders, and a market maker. Proved existence of sequential Kyle equilibrium for various distributions and information flows.
result Equilibria exist in mixed strategies but not in pure strategies, unlike in Kyle's original model.

Study stability of contingent claim solutions under probabilistic perturbations.

problem Stability of solutions to discrete-time contingent-claim problems under uncertainty.
method Use Rockafellian perturbations to analyze stability of solutions.
result Establishes convergence of dual problems and shadow prices.

A Neural Network (NN) based numerical method is formulated and implemented for solving Boundary Value Problems (BVPs) and numerical results are presented to validate this method by solving Laplace equation with Dirichlet boundary condition and Poisson's equation with mixed boundary conditions. The principal advantage o…

2019-09-24abs ↗pdf ↗

Discrete Gaussian noise preserves privacy and accuracy in differential privacy.

problem Finite computers cannot represent continuous Gaussian noise, leading to privacy breaches and loss of interpretability.
method Introduced and analyzed discrete Gaussian noise, providing privacy and accuracy guarantees similar to continuous Gaussian noise.
result Discrete Gaussian noise offers the same privacy and accuracy as continuous Gaussian noise, with efficient sampling algorithms.

Study shows financial value of weak information converges in discrete vs continuous markets.

problem Analyzing financial value of weak information in discrete vs continuous markets.
method Defined minimal probability measure and financial value of weak information, then showed convergence.
result Financial value of weak information converges in discrete vs continuous markets.

We apply a utility-based method to obtain the value of a finite-time investment opportunity when the underlying real asset is not perfectly correlated to a traded financial asset. Using a discrete-time algorithm to calculate the indifference price for this type of real option, we present numerical examples for the corr…

2006-04-13abs ↗pdf ↗

The paper constructs discrete Hessian and divdiv complexes on triangulations and proves their cohomology isomorphic to continuous versions.

problem Discrete construction of Hessian and divdiv complexes on triangulations.
method Construction of discrete Hessian and divdiv complexes using finite elements and Dirac measures on triangulations.
result The cohomology of the constructed complexes is isomorphic to the continuous de Rham cohomology.

CoNNTrA trains DNNs with low-power, low-memory constraints.

problem Training deep neural networks on edge computing systems with low power and memory usage.
method Coordinate gradient descent-based approach for training DNNs with constrained learning parameters.
result CoNNTrA models use 32x less memory and have comparable errors to Backpropagation models.

This paper demonstrates a practical method for computing the solution of an expectation-constrained robust maximization problem with immediate applications to model-free no-arbitrage bounds and super-replication values for many financial derivatives. While the previous literature has connected super-replication values …

2016-10-04abs ↗pdf ↗

Factorizes discrete representations of finitely generated groups into PSL(2, R).

problem Understanding discrete representations of finitely generated groups into PSL(2, R).
method Factorization theorem for Fuchsian groups, Makanin-Razborov diagrams, and new class of groups called PSL(2, R)-discrete limit groups.
result Obtained useful information about PSL(2, R)-discrete limit groups.

A new method for anomaly detection adapts to local non-stationarity in low-data regimes.

problem Adapting conformal anomaly detection to handle distribution shifts in real-world data.
method Proposes a continuous inference relaxation using continuous weighted kernel density estimation to decouple local adaptation from tail resolution.
result Restores detection capabilities and statistical power in low-data regimes while maintaining valid error control.

Paper proves a discrete Schwarz-Pick lemma for generalized circle packings.

problem Comparing geometric quantities of circle packings with different boundary values.
method Combinatorial Calabi flows and maximum principle.
result Discrete Schwarz-Pick lemma proven for generalized circle packings.

Study identifies and analyzes three types of errors in learning Fourier operators.

problem Statistical, discretization, and truncation errors in learning Fourier operators.
method Analysis of a Discrete Fourier Transform (DFT) based least squares estimator.
result Established upper and lower bounds on statistical, discretization, and truncation errors.

We develop methods to efficiently approximate data in metric spaces without additional assumptions.

problem Efficiently approximating data in metric spaces without imposing structural assumptions.
method Identify discrete modulus of continuity, investigate consistency, propose algorithm, and develop approximation theory.
result Consistent approximation of data in metric spaces without structural assumptions.

Study on 2-valued dynamics on complex plane, showing some dynamics can't be group actions.

problem Whether 2-valued dynamics can be defined by the action of a 2-valued group.
method Construction of examples of dynamics that are or are not group actions.
result Some 2-valued dynamics on complex plane cannot be defined by the action of a 2-valued group.

Recurrent neural networks (RNNs) are an effective representation of control policies for a wide range of reinforcement and imitation learning problems. RNN policies, however, are particularly difficult to explain, understand, and analyze due to their use of continuous-valued memory vectors and observation features. In …

2018-11-29abs ↗pdf ↗

Let MM be an open Riemann surface and n3n\ge 3 be an integer. We prove that on any closed discrete subset of MM one can prescribe the values of a conformal minimal immersion MRnM\to\mathbb{R}^n. Our result also ensures jet-interpolation of given finite order, and hence, in particular, one may in addition prescribe the…

2017-01-16abs ↗pdf ↗