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

3468101135 · Jun 202019922001200920172026
48 results for flexible window

Improved algorithm for optimal stopping problems reduces runtime.

problem Optimal stopping problems with infinite time horizon and random discounting.
method Flexible forward improvement iteration with a variable look-ahead distance.
result The new algorithm converges and can significantly reduce runtime.

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.

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 ↗

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.

Seglearn is an open-source python package for machine learning time series or sequences using a sliding window segmentation approach. The implementation provides a flexible pipeline for tackling classification, regression, and forecasting problems with multivariate sequence and contextual data. This package is compatib…

2018-03-21abs ↗pdf ↗

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.

The deep learning trend has recently impacted a variety of fields, including communication systems, where various approaches have explored the application of neural networks in place of traditional designs. Neural networks flexibly allow for data/simulation-driven optimization, but are often employed as black boxes det…

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

Developing a range-aware Bayesian optimization framework for discovering diverse designs within target property windows.

problem Discovering multiple, distinct solutions within target property windows.
method Range-aware Bayesian optimization framework.
result Consistently recovers larger and more diverse sets of valid designs.

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.

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.

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.

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.

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.

Exploiting the fact that most arrival processes exhibit cyclic behaviour, we propose a simple procedure for estimating the intensity of a nonhomogeneous Poisson process. The estimator is the super-resolution analogue to Shao 2010 and Shao & Lii 2011, which is a sum of pp sinusoids where pp and the frequency, amplitud…

2016-10-30abs ↗pdf ↗

Enhanced GARCH model uses autoencoder for volatility forecasting.

problem Selecting optimal realised volatility estimator for forecasting.
method Proposes an autoencoder-enhanced Realised GARCH model combining multiple realised measures.
result The model outperforms traditional linear methods in one-step-ahead rolling volatility forecasting.

Deep learning models price convertible bonds with complex reset and call features.

problem Pricing convertible bonds with path-dependent reset and call provisions.
method Formulated as a PPDE, deep learning approximates conditional expectations.
result Deep learning produces stable and accurate prices across various model specifications.

This study proposes a trainable adaptive window switching (AWS) method and apply it to a deep-neural-network (DNN) for speech enhancement in the modified discrete cosine transform domain. Time-frequency (T-F) mask processing in the short-time Fourier transform (STFT)-domain is a typical speech enhancement method. To re…

2018-11-05abs ↗pdf ↗

Study improves portfolio optimization for Indonesian banks using robust methods.

problem Uncertainty in historical return and risk estimates leads to suboptimal portfolios.
method Robust optimization with moving-window and bootstrapping methods.
result Moving-window method with smaller risk-aversion parameter provides better risk-return trade-off.