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.

169,181 papers · 148 categories

Trend · papers per month

76151227302 · Jun 202019922001200920182026
48 results for classical changes

New algorithms detect and react to multiple change points in online learning.

problem Learning under multiple change points in environments with unknown and frequent shifts.
method Proposed Anytime Tracking CUSUM (ATC) algorithms that balance detection of significant shifts.
result Properly tuned ATC algorithms achieve nearly minimax-optimal performance.

A new index measures how many changes are needed to turn virtual links into simple ones.

problem Determining the minimum number of changes needed to simplify virtual link diagrams.
method Defined the unknotting index using virtual crossings and classical changes, provided lower and upper bounds.
result Found bounds for the unknotting index of virtual links, including those from pretzel links.

New statistical test for change-point detection using relative entropy.

problem Offline change-point detection using divergence metrics.
method Study of empirical relative entropy distributions, derivation of approximations, introduction of new Berry-Esseen bounds.
result Theoretical and practical validation of relative entropy for change-point detection.

We consider the problem of quickest change-point detection in data streams. Classical change-point detection procedures, such as CUSUM, Shiryaev-Roberts and Posterior Probability statistics, are optimal only if the change-point model is known, which is an unrealistic assumption in typical applied problems. Instead we p…

2017-06-11abs ↗pdf ↗

Defines an implied CO2-price to cover climate change costs, finding it significantly higher than the SCC.

problem The social cost of carbon (SCC) does not fully cover climate change costs.
method Defines an implied CO2-price as a 'polluter pays principle' and calculates its value using a DICE model.
result The cost-implied CO2 price is around 500/tCO2,comparedto50/tCO2, compared to 50/tCO2 for SCC.

The paper analyzes how stock market dimensionality changes impact portfolio performance.

problem Impact of dimensional changes on portfolio performance in a changing market.
method Development of self-financing stock portfolios in a stochastic portfolio theory framework with dimensional jumps.
result Quantification of how listing or delisting events and market shocks affect portfolio return.

We study virtual isotopy sequences with classical initial and final diagrams, asking when such a sequence can be changed into a classical isotopy sequence by replacing virtual crossings with classical crossings. An example of a sequence for which no such virtual crossing realization exists is given. A conjecture on con…

2003-03-06abs ↗pdf ↗

Generalized change-point detection using various binary models.

problem Discovering changes in time series distribution.
method Direct density ratio estimation with Gradient Boosting over Decision Trees and Neural Networks.
result Proposed methods outperform classical RuLSIF algorithm.

This paper studies a specific metric on plane curves that has the property of being isometric to classical manifold (sphere, complex projective, Stiefel, Grassmann) modulo change of parametrization, each of these classical manifolds being associated to specific qualifications of the space of curves (closed-open, modulo…

2007-06-28abs ↗pdf ↗

In the present paper, we consider local moves on classical and welded diagrams: (self-)crossing change, (self-)virtualization, virtual conjugation, Delta, fused, band-pass and welded band-pass moves. Interrelationship between these moves is discussed and, for each of these move, we provide an algebraic classification. …

2015-10-14abs ↗pdf ↗

A symmetric union of two knots is a classical construction in knot theory which generalizes connected sum, introduced by Kinoshita and Terasaka in the 1950s. We study this construction for the purpose of finding an infinite family of hyperbolic non-fibered three-bridge knots of constant determinant which satisfy the we…

2015-07-29abs ↗pdf ↗

The changing nature of the relationship between a retail bank and its customers is examined, particularly with respect to new financial concepts, debt and regulation. The traditional image of a bank is portrayed as a physical building a classical Doric portico. This image conveys concepts of service, soundness, strengt…

2017-05-31abs ↗pdf ↗

New algorithm detects changes quickly without knowing parameters, near optimally.

problem Quickest change detection with unknown parameters.
method Leverages theoretical asymptotic properties to derive a scalable approximate algorithm with near optimal performance.
result Detects changes in constant complexity with near optimal performance.

Paper generalizes paracomposition and change of variables for paradifferential operators.

problem Generalizing paracomposition and change of variables for paradifferential operators in low regularity settings.
method Drops diffeomorphism hypothesis, estimates in Sobolev and Zygmund spaces, discusses pull-back of pseudodifferential and paradifferential operators.
result Sharp estimates for composition in Sobolev and Zygmund spaces, change of variables in paradifferential operators.

This paper improves change-point detection for complex data streams using denoising score matching.

problem Timely identification of distributional shifts in high-dimensional, complex data streams.
method Score-based CUSUM change-point detection with denoising score matching.
result Denoising score matching enhances detection power by effectively controlling noise scale.

New method detects and locates changes in spatio-temporal point processes.

problem Detecting and localizing changes in spatio-temporal data.
method Score-based, likelihood-free approach estimating change time and region.
result The method provides theoretical guarantees on detection and localization accuracy.

Nearly all field theories suffer from singularities when particles are introduced. This is true in both classical and quantum physics. Classical field singularities result in the notorious self-force problem, where it is unknown how the dynamics of a particle change when the particle interacts with its own (self) field…

2015-03-03abs ↗pdf ↗

Model change points in time-series data with neural SDEs and variational autoencoders.

problem Modeling change points in time-series data with neural stochastic differential equations.
method Proposes a novel model formulation and training procedure based on the variational autoencoder framework, alternating between updating neural SDE parameters and change points.
result Demonstrates the expressive power of the proposed model in modeling both classical parametric SDEs and real datasets with distribution shifts.

Cross-validation pitfalls in change-point regression are addressed with new approaches.

problem Cross-validation's prediction error-based criterion may lead to under- or over-estimation of change-points.
method Proposes two approaches: absolute error loss and modified holdout sets.
result Consistent estimation of the number of change-points under certain conditions.

Paper proposes a fast method to detect changes in audiometric function.

problem Detecting changes in psychometric function estimation quickly and accurately.
method Bayesian active differential selection for pure-tone audiogram testing.
result Fewer tones can detect changes in audiometric function with high confidence.

Singular Yamabe problems involve changing sign solutions with interesting geometric properties.

problem Solving Yamabe problems with changing sign solutions and their geometric implications.
method Analyzing the behavior of conformal factors and zero loci in various dimensions.
result Zero loci of solutions are critical for conformal functionals and can be Willmore energy minimizers.

New algorithm detects and adapts to changes in multi-armed bandit problems.

problem Adaptive learning in multi-armed bandit problems with piecewise-stationary reward distributions.
method Incorporates change detection with classic UCB algorithms to achieve nearly optimal regret bound.
result Achieves nearly optimal regret bound of O(MKTlogT)O(\sqrt{MKT\log T}).

We show that the Lagrangian of classical mechanics on a Riemannian manifold of bounded geometry carries a periodic solution of motion with rescribed energy, provided the potential satisfies an asymptotic growth condition, changes sign, and the negative set of the potential is non-trivial in the relative homology.

2013-05-13abs ↗pdf ↗

The unknotting number is the classical invariant of a knot. However, its determination is difficult in general. To obtain the unknotting number from definition one has to investigate all possible diagrams of the knot. We tried to show the unknotting number can be obtained from any one diagram of the knot. To do this we…

2013-03-28abs ↗pdf ↗

New method for fast volatility estimation robust to change points.

problem Robust high-frequency volatility estimation with change points.
method ℓ1-regularized power variation estimators using LARS for sparse estimation and dynamic programming for change point refinement.
result Minimax rates achieved for volatility estimators, providing accurate and smooth forecasts.

NEWMA detects changes in multi-dimensional data streams efficiently.

problem Detecting abrupt changes in multi-dimensional time series with limited resources.
method A simple, model-free online change-point detection method using two EWMA statistics with different forgetting factors and Random Features.
result The method is significantly faster than usual non-parametric methods for a given accuracy.

Study sharpens unlinking number bounds for special alternating links.

problem Determining the exact unlinking number for special alternating links.
method Analyzes links in the 3-sphere, focusing on special alternating links and their crossing changes.
result Sharp lower bounds for unlinking number realized by crossing changes in alternating diagrams.

A new robust and flexible classification method for non-Gaussian data.

problem Robustness to scale changes and non-Gaussian distributions in classical discriminant analysis.
method FEMDA uses arbitrary Elliptically Symmetrical distributions and scale parameters for each data point.
result FEMDA is robust to scale changes and outperforms other methods.

Detecting the emergence of an abrupt change-point is a classic problem in statistics and machine learning. Kernel-based nonparametric statistics have been used for this task which enjoy fewer assumptions on the distributions than the parametric approach and can handle high-dimensional data. In this paper we focus on th…

2015-07-05abs ↗pdf ↗

In this paper, we introduce two alternative extensions of the classical univariate Value-at-Risk (VaR) in a multivariate setting. The two proposed multivariate VaR are vector-valued measures with the same dimension as the underlying risk portfolio. The lower-orthant VaR is constructed from level sets of multivariate di…

2011-11-05abs ↗pdf ↗

Proposes training objectives for neural networks to produce robust attributions.

problem Training models that produce robust interpretations for their predictions.
method Classic robust optimization models and Integrated Gradients (IG) for axiomatic attribution.
result The proposed objectives give principled generalizations of previous objectives for robust predictions.

The paper examines how the topology of level sets changes with critical points in Morse theory.

problem Understanding how the topology of level sets changes with critical points in Morse theory.
method Study of sublevel sets and level sets of Morse functions, analysis of critical points and their indices.
result For a general class of functions, the topology of a regular level set changes when passing a single critical point, unless the index is half the dimension of the manifold.

Two virtual link diagrams are homotopic if one may be transformed into the other by a sequence of virtual Reidemeister moves, classical Reidemeister moves, and self crossing changes. We recall the pure virtual braid group. We then describe the set of pure virtual braids that are homotopic to the identity braid.

2007-04-23abs ↗pdf ↗