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

12233546 · May 202619922001200920172026
48 results for variable-length windows

ALT improves TSC by capturing complex patterns in time series data.

problem Challenges in traditional TSC methods with time series complexity and variability.
method ALT incorporates variable-length shifted time windows to enhance LLT for better feature representation.
result ALT achieves state-of-the-art performance with few hyperparameters.

Predicts next actions in soccer possessions using path signatures.

problem Predicting next actions in soccer possessions with high accuracy.
method Leveraging path signatures to encode spatio-temporal structure of recent possessions, avoiding manual feature engineering.
result Our approach outperforms transformer-based benchmarks across various loss metrics and reduces computational cost.

While neural sequence generation models achieve initial success for many NLP applications, the canonical decoding procedure with left-to-right generation order (i.e., autoregressive) in one-pass can not reflect the true nature of human revising a sentence to obtain a refined result. In this work, we propose XL-Editor, …

2019-10-19abs ↗pdf ↗

Optimal weight windows are symmetric rectangles centered at peak.

problem Finding the best weight windows for weighted least squares.
method Investigated symmetric and tapered rectangle window weights, showing the best rectangle window is optimal.
result The best rectangle window is optimal for all tapered rectangle window definitions.

ReCAP adapts to dynamic financial markets by segmenting and combining policy vectors.

problem Inefficient traditional PM approaches in non-stationary financial markets.
method Integrates continual learning into PM, segmenting regimes and adapting policies.
result Consistently outperforms baselines in real-world financial datasets.

One of the ubiquitous representation of long DNA sequence is dividing it into shorter k-mer components. Unfortunately, the straightforward vector encoding of k-mer as a one-hot vector is vulnerable to the curse of dimensionality. Worse yet, the distance between any pair of one-hot vectors is equidistant. This is partic…

2017-01-23abs ↗pdf ↗

A new kernel Stein test assesses fit for variable-length sequential data.

problem Evaluating goodness of fit for varying-dimensional data like text documents of different lengths.
method Extends kernel Stein discrepancy (KSD) to variable-dimension settings by identifying appropriate Stein operators and proposing a novel KSD goodness-of-fit test.
result The proposed test performs well on discrete sequential data benchmarks.

Optimal weight windows are found by projecting the origin onto a convex polytope.

problem Finding the best weight windows for a weighted moving average smoother.
method Formulated as a quadratic program and projection onto a convex polytope.
result Optimal weight windows are symmetrical and decrease in weight away from the center.

We study topology of configuration spaces of planar linkages having one leg of variable length. Such telescopic legs are common in modern robotics where they are used for shock absorbtion and serve a variety of other purposes. Using a Morse theoretic technique, we compute explicitly, in terms of the metric data, the Be…

2009-09-16abs ↗pdf ↗

Current end-to-end deep Reinforcement Learning (RL) approaches require jointly learning perception, decision-making and low-level control from very sparse reward signals and high-dimensional inputs, with little capability of incorporating prior knowledge. This results in prohibitively long training times for use on rea…

2018-09-20abs ↗pdf ↗

Paper introduces a differentiable STFT for continuous window length optimization.

problem Optimizing window length in spectrograms for neural networks.
method Defines a differentiable short-time Fourier transform with continuous window length.
result Demonstrates improved performance in estimation and classification tasks.

New linear models improve time series classification efficiency and interpretability.

problem Complex and inefficient classifiers limit interpretability and applicability to variable-length time series.
method Symbolic representations, multi-resolution, multi-domain, linear models.
result mtSS-SEQL+LR achieves similar accuracy to state-of-the-art methods but with lower time and memory usage.

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.

We present a new algorithm for the 2D Sliding Window Discrete Fourier Transform (SWDFT). Our algorithm avoids repeating calculations in overlapping windows by storing them in a tree data-structure based on the ideas of the Cooley- Tukey Fast Fourier Transform (FFT). For an N0×N1N_0 \times N_1 array and n0×n1n_0 \times n_1 wi…

2017-07-25abs ↗pdf ↗

Improved convergence of fixed-point methods using windowed Anderson acceleration.

problem Improving convergence of fixed-point methods for symmetric operators.
method Windowed Anderson acceleration for symmetric fixed-point iterations.
result Windowed Anderson acceleration improves convergence over standard fixed-point methods.

Improved Granger causality method for dynamic time series data.

problem Traditional Granger causality method assumes constant causalities, failing to model dynamic causalities.
method Dynamic window-level Granger causality (DWGC) method with causality indexing.
result Improved DWGC method better detects window-level causalities.

WeldNet reduces complex dynamics to simpler, manageable segments.

problem Complex, high-dimensional time-dependent datasets from physical processes are costly to simulate.
method Windowed Encoders for Learning Dynamics, splitting time domain into windows for nonlinear dimension reduction and propagator training.
result WeldNet captures nonlinear latent structures and dynamics, outperforming existing methods.

In many applications, monitoring area under the ROC curve (AUC) in a sliding window over a data stream is a natural way of detecting changes in the system. The drawback is that computing AUC in a sliding window is expensive, especially if the window size is large and the data flow is significant. In this paper we propo…

2019-02-02abs ↗pdf ↗

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.

BWS selects best window subsets for efficient data pruning.

problem Challenges in selecting subsets of large datasets for neural network training.
method Best Window Selection (BWS) by choosing optimal window intervals from ordered sample scores.
result BWS outperforms other methods across various selection ratios and datasets.

Occupant behavior (OB) and in particular window openings need to be considered in building performance simulation (BPS), in order to realistically model the indoor climate and energy consumption for heating ventilation and air conditioning (HVAC). However, the proposed OB window opening models are often biased towards …

2018-07-10abs ↗pdf ↗

We identify 'critical windows' in diffusion models where specific features emerge, providing a theoretical framework.

problem Understanding narrow time intervals in diffusion models where specific features emerge.
method Developed a formal framework to study these critical windows, showing provable bounds for certain data types.
result Proved that critical windows can be bounded in terms of measures of separation for data from mixtures of log-concave densities.

We present the Latent Sequence Decompositions (LSD) framework. LSD decomposes sequences with variable lengthed output units as a function of both the input sequence and the output sequence. We present a training algorithm which samples valid extensions and an approximate decoding algorithm. We experiment with the Wall …

2016-10-10abs ↗pdf ↗

Proposes a method to train classifiers with delayed feedback using a time window.

problem Training classifiers with delayed feedback that can be biased due to delayed user actions.
method Uses a time window to select samples for training, constructs unbiased empirical risk from all samples.
result Improves classifier performance by using all samples with a time window assumption.

Tree-based LSTM improves sequential regression with missing data.

problem Regression for variable-length sequential data with missing samples.
method Tree architecture of LSTM networks, selecting LSTM networks based on presence-pattern of previous inputs.
result Significant performance improvements on financial and real-life datasets.

Statistical test verifies long-term rating system calibration with overlapping time windows.

problem Verifying supervisory requirements for overlapping time windows in rating systems.
method Analyzes long-run default rate distribution and correlation effects; presents conservative calibration test methods.
result Developed a test for individual and portfolio levels that can handle unknown variance.

CrossAD detects anomalies in time series data by considering cross-scale associations and cross-window modeling.

problem Anomaly detection in time series data is challenging due to varying patterns at different scales and fixed window sizes.
method CrossAD incorporates cross-scale reconstruction and a query library to capture dynamic cross-scale associations and comprehensive context.
result CrossAD achieves state-of-the-art performance in anomaly detection across multiple real-world datasets.

K-fold Cross Validation is commonly used to evaluate classifiers and tune their hyperparameters. However, it assumes that data points are Independent and Identically Distributed (i.i.d.) so that samples used in the training and test sets can be selected randomly and uniformly. In Human Activity Recognition datasets, we…

2019-04-04abs ↗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.