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

Trend · papers per month

81162243324 · Jun 202019922001200920182026
48 results for sliding property

We present a new operation to be performed on elements in a Garside group, called cyclic sliding, which is introduced to replace the well known cycling and decycling operations. Cyclic sliding appears to be a more natural choice, simplifying the algorithms concerning conjugacy in Garside groups and having nicer theoret…

2008-08-10abs ↗pdf ↗

A knot K in the 3-sphere is said to have Property nR if, whenever K is a component of an n-component link L and some integral surgery on L produces the connected sum of n copies of S^1 x S^2, there is a sequence of handle slides on L that converts L into a 0-framed unlink. The Generalized Property R Conjecture is that …

2009-08-19abs ↗pdf ↗

New bound on sliding circuit set size in braid groups.

problem Bounding the size of sliding circuit sets in braid groups.
method Constructing examples of braids with multiple subsurfaces to suggest a geometric property.
result Found a family of braids with a sliding circuit set of at most CLN2C \cdot L^{N-2} elements, suggesting a geometric property.

We find conditions for roots of crosscap slides and transpositions on nonorientable surfaces.

problem Understanding roots of crosscap slides and transpositions on nonorientable surfaces.
method Analyzing the mapping class group of nonorientable surfaces and conditions for roots.
result Necessary and sufficient conditions for the existence of roots of crosscap slides and transpositions.

The paper analyzes the sliding regret of stochastic bandit algorithms.

problem Measuring the one-shot behavior of no-regret algorithms in stochastic bandits.
method Introducing sliding regret to measure the worst pseudo-regret over a time-window.
result Randomized methods have optimal sliding regret, while index policies have the worst possible sliding regret.

In this paper we study the reduction curves of a braid, and how they can be used to decompose the braid into simpler ones in a precise way, which does not correspond exactly to the decomposition given by Thurston theory. Then we study how a cyclic sliding (which is a particular kind of conjugation) affects the normal f…

2010-06-11abs ↗pdf ↗

Novel time series forecasting method using sliding window signatures.

problem Challenges in forecasting nonlinear and delayed time series data.
method Ridge regression with signature features calculated on sliding windows.
result Signature features effectively encode temporal and nonlinear dependencies, leading to accurate forecasts.

Optimizes sliding window approach for tracking Gaussian densities.

problem Improving tracking performance of Gaussian density estimation.
method Theoretical analysis of sliding window Gaussian Kernel Density Estimators.
result Empirical evidence shows improved tracking performance with optimal weight sequence.

Sliding window algorithm for RL in non-stationary MDPs with varying rewards and transitions.

problem Reinforcement learning in Markov Decision Processes with changing state-transition probabilities and reward functions.
method Sliding window approach for handling non-stationarity.
result Performance guarantees and optimal window size for the algorithm, along with a sample complexity bound.

We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its conjugacy class which we call the stabilized set of sliding circuits, and if it …

2010-08-02abs ↗pdf ↗

A theorem of Kirby states that two framed links in the 3-sphere produce orientation-preserving homeomorphic results of surgery if they are related by a sequence of stabilization and handle-slide moves. The purpose of the present paper is twofold: First, we give a sufficient condition for a sequence of handle-slides on …

2005-09-02abs ↗pdf ↗

New algorithms achieve optimal regret in sliding window model with limited memory.

problem Experts problem in the sliding window model with limited information.
method 2 queries, polylog(nT) memory, exponential improvement on memory.
result Achieve optimal regret of sqrt(nW)polylog(nT) with 2 queries and polylog(nT) memory.

TAKDE optimizes kernel density estimation for real-time dynamic processes.

problem Real-time density estimation in applications like computer vision and signal processing.
method Derives asymptotic mean integrated squared error (AMISE) upper bound for 'sliding window' kernel density estimator and proposes TAKDE as a novel, theoretically optimal estimator.
result TAKDE outperforms other dynamic density estimators in terms of test log-likelihood and runtime.

We propose a means by which some categorifications can be evaluated at a root of unity. This is implemented using a suitable localization in the context of prior work by the authors on categorification of the Jones-Wenzl projectors. Within this construction we define objects, invariant under handle slides, which decate…

2011-10-10abs ↗pdf ↗

Novel model SLIDE for multi-view data integrates shared and individual components.

problem Modeling partially-shared components and identifying component types.
method SLIDE model that directly incorporates partially-shared structures, proving existence and identifiability conditions.
result SLIDE demonstrates excellent performance in signal estimation and component selection.

New robustness certificates for streaming models with a sliding window.

problem Applying robustness certificates to streaming data with correlated inputs.
method Deriving robustness certificates for models using a sliding window over a sequence of potentially correlated inputs.
result Guarantees hold for the average model performance across the entire stream, independent of stream size.

Bordered Heegaard Floer homology is an invariant for three-manifolds with boundary. In particular, this invariant associates to a handle decomposition of a surface F a differential graded algebra, and to an arc slide between two handle decompositions, a bimodule over the two algebras. In this paper, we describe these b…

2010-10-13abs ↗pdf ↗

Improved RNN predicts patient health from ICU data.

problem Slowed response times and missed true alarms from ICU alarms.
method Compare sliding window and recurrent predictors for ICU multivariate time series.
result RNN slightly improved for three out of four patient state-of-health targets.

Study examines asset pricing using various attention models, finding global self-attention and sliding window sparse attention models perform well.

problem Traditional asset pricing models miss temporal dependency and short memory issues.
method Investigates RNN attention models with various attention mechanisms for large-cap US stocks.
result Global self-attention and sliding window sparse attention models outperform in deriving returns and hedging risks, especially during the pandemic.

New sublinear sketches improve ANN and KDE for massive data streams.

problem Efficiently approximate nearest neighbors and kernel density estimation in large datasets.
method Developed sublinear space and query time algorithms for ANN and A-KDE in streaming and sliding-window models.
result Achieved near-optimal trade-offs between memory size and approximation error for ANN.

Automated malaria diagnosis from field slides achieves accurate results.

problem Challenges in analyzing field-prepared thin blood film microscopy images.
method Fully automated framework using machine learning, including CNNs trained on diverse field samples.
result Results are close to sufficient for drug resistance monitoring and clinical use-cases.

Paper studies simplified trisections and their equivalence classes.

problem Understanding right-left equivalence of simplified (2,0)(2, 0)-trisections.
method Analyzes simplified trisection diagrams and upper-triangular handle-slides.
result At least two simplified (2,0)(2, 0)-trisections can be right-left equivalent without being related by automorphisms or handle-slides.

We present the classical Wagner construction from 1935 of the curvature tensor for completely nonholonomic manifolds in both invariant and coordinate way. The starting point is the Shouten curvature tensor for nonholonomic connection introduced by Vranceanu and Shouten. We illustrate the construction on two mechanical …

2003-04-11abs ↗pdf ↗

We give an example of two JSJ decompositions of a group that are not related by conjugation, conjugation of edge-inclusions, and slide moves. This answers the question of Rips and Sela stated in "Cyclic splittings of finitely presented groups and the canonical JSJ decomposition," Ann. of Math. 146 (1997), 53-109. On th…

2001-10-17abs ↗pdf ↗

Recently the statistical characterizations of financial markets based on physics concepts and methods attract considerable attentions. We used two possible procedures of analyzing multifractal properties of a time series. The first one uses the continuous wavelet transform and extracts scaling exponents from the wavele…

2006-08-01abs ↗pdf ↗

Classifies solutions to critical sixth order equations with a singularity.

problem Classifying entire positive singular solutions to critical sixth order equations.
method Integral sliding methods, qualitative analysis of ODEs, topological two-parameter shooting technique.
result Solutions are given by a singular radial factor times a periodic solution to a sixth order IVP with constant coefficients.

The paper analyzes SW-SGD for MSE in biased and variance-reduced gradient estimators.

problem Analyzing MSE of SW-SGD in biased and variance-reduced gradient estimators.
method Using asymptotic normality, the paper characterizes SW-SGD's mean and variance, proving convergence and showing SW-SGD's superiority over SGD.
result SW-SGD incurs lower MSE than SGD on quadratic and convex problems.

Seglearn segments time series data for machine learning tasks.

problem Handling multivariate sequence and contextual data for classification, regression, and forecasting.
method Sliding window segmentation approach within a scikit-learn compatible pipeline.
result Efficient learning of time series data for various machine learning tasks.

Paper disproves a theorem about Kauffman bracket skein module structure.

problem Disproving a 22-year-old theorem about Kauffman bracket skein module structure.
method Analyzing handle slidings on compressing discs in handlebodies.
result More relations found than previously predicted for connected sum of handlebodies.