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

67135202269 · Jun 202019922001200920172026
48 results for Discrete Changes

Unified framework detects changes in complex system models.

problem Accurate identification of dynamic changes in simulation models.
method Combines machine learning and process-driven simulation modeling.
result Significantly improves change point detection accuracy.

Change-point analysis is a flexible and computationally tractable tool for the analysis of times series data from systems that transition between discrete states and whose observables are corrupted by noise. The change-point algorithm is used to identify the time indices (change points) at which the system transitions …

2015-05-21abs ↗pdf ↗

Bayesian Context Trees improve change-point detection in discrete data.

problem Detecting and segmenting change-points in discrete time series data.
method Bayesian Context Trees framework, Markov chain Monte Carlo sampling.
result Effective sampling from posterior distribution of change-points.

Our work proves robustness of embedding schemes to discrete changes in text.

problem Discrete changes in text, like replacing a word, affect model robustness.
method Formal proofs and quantitative bounds for embedding schemes (concatenation, TF-IDF, Paragraph Vector).
result Embedding schemes are robust to discrete changes in text with Hölder or Lipschitz properties.

The study tackles modeling high-frequency financial data using continuous distributions, finding them inadequate.

problem Challenges in modeling high-frequency integer price changes with continuous distributions.
method Proposed a modified maximum likelihood estimation procedure to account for the discreteness of high-frequency price changes.
result Traditional GARCH models are not suitable for high-frequency data due to the discreteness of price changes.

New algorithm learns changing discrete distributions with minimal drift error.

problem Learning discrete distributions that change over time with limited past samples.
method Adaptive algorithm using data-dependent bounds to balance statistical and drift errors.
result Tighter statistical error bounds for drifting distributions with or without finite support.

The paper proves a new discrete Laplacian for 3D meshes and shows its superiority over primal construction.

problem Developing a more accurate discrete Laplacian for 3D meshes.
method Proves the Euler-Lagrange equation for the Dirichlet energy using the associated discrete Laplacian of the dual construction.
result The associated discrete Laplacian is optimal in R3\mathbb{R}^3 compared to the primal construction.

Develops deep jump learning for continuous treatment OPE.

problem Estimating mean outcomes under new treatment rules using historical data from different rules.
method Adaptive deep discretization of continuous treatment space using deep learning and multi-scale change point detection.
result Validated method through theoretical results, simulations, and real application to Warfarin Dosing.

This paper proposes a novel model of financial prices where: (i) prices are discrete; (ii) prices change in continuous time; (iii) a high proportion of price changes are reversed in a fraction of a second. Our model is analytically tractable and directly formulated in terms of the calendar time and price impact curve. …

2014-10-27abs ↗pdf ↗

We present a notion of super Ricci flow for time-dependent finite weighted graphs. A challenging feature is that these flows typically encounter singularities where the underlying graph structure changes. Our notion is robust enough to allow the flow to continue past these singularities. As a crucial tool for this purp…

2018-05-17abs ↗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 ↗

Despite remarkable successes, Deep Reinforcement Learning (DRL) is not robust to hyperparameterization, implementation details, or small environment changes (Henderson et al. 2017, Zhang et al. 2018). Overcoming such sensitivity is key to making DRL applicable to real world problems. In this paper, we identify sensitiv…

2019-01-28abs ↗pdf ↗

Study examines how slight model changes affect multi-period optimization outcomes.

problem Effect of small probabilistic model changes on multi-period optimization problems.
method Adapted Wasserstein distance for measuring changes, explicit first-order approximations proved.
result Explicit first-order approximations for multi-period stochastic optimization and optimal stopping problems.

This work analyzes discrete diffusion models using stochastic integrals, providing error bounds and insights.

problem Error analysis for discrete diffusion models remains less understood.
method Proposes a comprehensive framework based on Lévy-type stochastic integrals.
result Obtains the first error bound for the ττ-leaping scheme in KL divergence.

New method reduces discrete flow transitions, improving perplexity estimation.

problem Stochasticity in discrete paths makes rectification strategies ineffective.
method Dynamic-optimal-transport-like minimization objective with minibatch strategies.
result 32 times reduction in transitions for same perplexity.

Develops a new method to measure causal effects in continuous and discrete settings.

problem Measuring direct causal effects in complex scenarios with continuous and interventionally changing variables.
method Probabilistic Easy Variational Causal Effect (PEACE) method, developed for both continuous and discrete cases.
result PEACE can measure causal effects under various conditions and is stable under small changes.

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 ↗

Paper extends SI method for detecting CPs in complex systems' frequency domain.

problem Identifying change points in complex systems' frequency domain.
method Extends SI framework to frequency domain using DFT properties and develops valid p-values.
result Reliable detection of genuine CPs with strong statistical guarantees.

We study the problem of learning sparse structure changes between two Markov networks PP and QQ. Rather than fitting two Markov networks separately to two sets of data and figuring out their differences, a recent work proposed to learn changes \emph{directly} via estimating the ratio between two Markov network models…

2014-07-02abs ↗pdf ↗

Study examines pricing strategies in competitive supply chains with discrete prices.

problem Inaccurate assumptions in traditional SC models for pricing decisions.
method Examines a SC model with one supplier and two manufacturers, considering customer demand segmentation and discrete price setting.
result Nash equilibria among manufacturers are not unique, and low denomination factors can lead to instability.

A new sampler for complex discrete distributions efficiently updates all variables in parallel.

problem Sampling complex high-dimensional discrete distributions efficiently and accurately.
method Discrete Langevin proposal (DLP) for parallel coordinate updates with controlled stepsize.
result DLP efficiently explores high-dimensional and strongly correlated variables with asymptotic bias of zero for log-quadratic distributions.

Process Monitoring involves tracking a system's behaviors, evaluating the current state of the system, and discovering interesting events that require immediate actions. In this paper, we consider monitoring temporal system state sequences to help detect the changes of dynamic systems, check the divergence of the syste…

2018-07-09abs ↗pdf ↗

Spin networks are at the core of quantum gravity. Our aim is to plug the mathematical community at large into the procedures turn to create a finite quantum theory of general relativity. For this, because of the different cultural backgraund, we would like to change the tack: to relate discrete (combinatorial) objects …

2000-11-05abs ↗pdf ↗

The potential function of the optimistic limit of the colored Jones polynomial and the construction of the solution of the hyperbolicity equations were defined in the authors' previous articles. In this article, we define the Reidemeister transformations of the potential function and the solution by the changes of them…

2015-09-08abs ↗pdf ↗

Hybrid RL method optimizes trading by balancing continuous and discrete actions.

problem Optimal execution in algorithmic trading with continuous-discrete action space.
method Combines continuous and discrete RL agents for better trading decisions.
result Significantly outperforms existing methods in trading efficiency and stability.

In a previous paper, we showed how certain orientations of the edges of a graph G embedded in a closed oriented surface S can be understood as discrete spin structures on S. We then used this correspondence to give a geometric proof of the Pfaffian formula for the partition function of the dimer model on G. In the pres…

2007-04-02abs ↗pdf ↗