Optimizes phonetic recognition system to reduce latency.
problem Reducing latency in CD-DNN based phoneme recognition.
method Shifted input window with up to 5 frames of past context.
result Improves latency by 50 ms with asymmetric window.
MLAT improves kNN performance in time series by learning metrics that align and capture temporal dependencies.
problem Improving kNN performance in time series by learning metrics that effectively handle variations and temporal dependencies.
method MLAT uses a sliding window to augment time series data and applies time-invariant metric learning to derive the most appropriate distance measure.
result MLAT outperforms other existing algorithms in various real-world data sets.
The paper improves alignment methods for deep neural networks using geometric and spectral analysis.
problem Improving alignment methods for deep neural networks.
method Geometric and spectral analysis of residual Jacobian chains.
result Deterministic and margin-verified results on the transport of dominant singular subspaces across layers.
Study on liquidity dynamics in Uniswap v3 pools using statistical methods.
problem Characterize liquidity in Uniswap v3 pools.
method Functional principal component analysis (FPCA) and dynamic factor methods.
result Liquidity dynamics in Uniswap v3 pools are well-captured by a low-order Legendre polynomial basis.
Improved RL training for DMs reduces mode collapse and preserves diversity.
problem Mode collapse and training instability in RL fine-tuned diffusion models.
method Dynamic hierarchical RL training with sliding-window parameter regularisation.
result Models trained with HRF achieve better preservation of diversity in downstream tasks.
New study on time series anomaly detection shows overlapping inference improves performance.
problem Heterogeneous evaluation practices and inference procedures in time series anomaly detection.
method Unified training, tuning, and evaluation protocol on TSB-AD benchmark, analyzing overlapping vs. disjoint inference.
result Overlapping inference yields consistent improvements, with average relative gain up to +28%.
The paper introduces a diagnostic method to detect grokking transitions in models before test accuracy improves.
problem Detecting the transition from training to generalization in machine learning models.
method Summarize task-dependent observables as empirical distributions, map them to Wasserstein/quantile coordinates, and analyze using Hankel dynamic mode decomposition.
result The diagnostic method achieves AUROC \(\approx\) 0.93 for grokking-vs-non-grokking discrimination at the run level.
This paper investigates bias in resampled backtests for financial portfolios, finding it often negligible.
problem Bias in resampled backtests for financial portfolio evaluation.
method Investigation of bias in rolling-window mean-variance portfolios using resampling techniques.
result The bias in Sharpe Ratio estimates from IID resampling is often a fraction of estimation noise, making it tolerable.
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.
The paper shows that causal identification is not essential for efficient portfolios, focusing on geometric sufficiency conditions.
problem The necessity of causal identification for efficient portfolios.
method Re-examination of predictive signals and their impact on portfolio efficiency under structural misspecification.
result Efficiency is governed by geometric sufficiency conditions (directional alignment, ranking preservation, and calibration) rather than causal identification.
tsflex speeds up time series processing and feature extraction.
problem Inefficient and inflexible time series processing tools.
method Flexible Python toolkit exttttsflex for multivariate, asynchronous time series. result Significantly faster and more memory-efficient than existing packages.
AutoQuant addresses cryptocurrency backtesting fragility by modeling execution costs and improving strategy selection.
problem Fragile backtests of cryptocurrency perpetual futures ignoring microstructure frictions and execution costs.
method Execution-centric framework with Bayesian optimization, double screening, and strict T+1 semantics.
result Fee-only and zero-cost backtests overestimate returns, highlighting the importance of modeling execution costs.
A new model decomposes equity returns and volatilities into memory components.
problem Understanding long-term equity dynamics and volatility patterns.
method Proposes a multivariate generalization of the variance ratio to decompose long-horizon equity dynamics.
result Identifies a five-factor model capturing persistent, antipersistent, and multi-scale memory in returns and volatility.
Paper proposes SPO paradigm for better portfolio optimization in real markets.
problem Real-world trading frictions and constraints affect portfolio optimization quality.
method SPO paradigm with decision-focused training using surrogate loss and linear predictors.
result Decision-focused training improves risk-adjusted performance and robustness.
Differentiable Window improves attention modules by enabling more focused attentions.
problem Improving attention mechanisms in neural networks.
method Proposes Differentiable Window, a neural module for dynamic window selection.
result Consistent and sizable improvements across various NLP tasks.
Simple soft sensor models improve prediction accuracy with small moving windows.
problem Improving prediction accuracy in soft sensing processes with limited historical data.
method Five simple soft sensor methodologies with small moving windows were compared.
result Small moving window sizes led to the lowest prediction errors for all methods.
BAWS adapts window size for financial risk forecasting.
problem Adaptive selection of look-back window for financial risk modeling.
method Data-driven online learning method using bootstrap-based adaptive window selection (BAWS).
result BAWS improves risk forecasting, especially in data with structural changes.
Study fusion methods for financial image views to improve robustness against attacks.
problem Improving robustness of financial image views for next-day direction prediction.
method Same-source multi-view learning with early fusion and late fusion, using OHLCV and technical-indicator views, and evaluating pixel-space L-infinity attacks.
result Early fusion can suffer negative transfer under noisy settings, while late fusion is more reliable once labels stabilize.
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.
A new method improves SSVEP BCI to recognize responses in sub-second time with high accuracy.
problem Achieving high accuracy in SSVEP BCI with short response times.
method CSTA (Combining Spatial-Filtering and Temporal Alignment) method.
result CSTA achieves maximum mean accuracy of 97.43% in sub-second response time.
Method detects lead-lag relationships in multivariate time series.
problem Discovering lead-lag relationships in multivariate time series.
method Clustering-driven methodology using sliding window and various clustering techniques.
result Robust lead-lag estimates across clusters enhance consistent relationships identification.
Bayesian method corrects timing misalignment in recurrent event studies.
problem Estimating differences in event rates under two treatments with timing misalignment.
method g-computation procedure with joint semiparametric Bayesian model.
result Correctly estimates average causal effects under right-censoring.
Paper proposes efficient AUC estimation in sliding windows.
problem Efficiently monitoring AUC in large sliding windows over data streams.
method Algorithm groups data points to estimate AUC with O((logk)/ε) time per update. result Achieves significant speed-up over exact computation with modest accuracy loss.
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.
Deep learning model predicts window openings for commercial buildings.
problem Window openings are often biased and require tuning for each occupant.
method Deep learning model trained on occupant data from multiple buildings.
result Model achieves high evaluation accuracy and F1 scores.
The paper tackles temporal coverage bias in financial panel data, proposing a structuring framework to correct for incomplete histories.
problem Incomplete histories of financial instruments lead to biased panel data.
method Formalizes the problem and proposes a coverage-aware structuring framework using structured metadata and an availability matrix.
result The framework reveals substantial distortions in return dynamics and volatility when naive temporal alignment is used.
New algorithm for 2D SWDFT reduces redundant calculations.
problem Redundant calculations in overlapping windows for 2D SWDFT.
method Tree data structure based on Cooley-Tukey FFT for efficient computation.
result Our algorithm reduces operations to O(N0N1n0n1). 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.
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.
The paper optimizes predicting future window states in buildings using past climate data.
problem Predicting future window opening actions based on past climate data.
method Trained a deep neural network to predict window states using indoor climate data sequences of 30-240 time-steps.
result Optimal predictive performance achieved with 60 time-steps of indoor climate data, and long sequences could be addressed efficiently.
Auto-regressive models improve smoothing efficiency with exponentially tapered windows.
problem Improving time-series smoothing efficiency.
method An auto-regressive formulation for time-series smoothing.
result Auto-regressive models result in moving means with exponentially tapered windows.
Proposes a sliding window method for better portfolio trading.
problem Log-optimal portfolio problem with time-varying weights.
method Data-driven sliding window approach to solve log-optimal portfolio problem.
result Trading strategy outperforms classical log-optimal portfolio in cumulative returns.
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.
Study predicts cryptocurrency trends using LSTM model.
problem Predicting cryptocurrency price trends.
method Combination of window-sliding and prediction range method with LSTM model.
result Established model for cryptocurrency price trend prediction.
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.
Subject Cross Validation improves Human Activity Recognition performance by up to 16%.
problem Overestimation of Human Activity Recognition performance using k-fold cross validation.
method Investigated Subject Cross Validation vs. k-fold cross validation for Human Activity Recognition.
result Subject Cross Validation increases performance by up to 16%.
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 study the dynamics of the linear and non-linear serial dependencies in financial time series in a rolling window framework. In particular, we focus on the detection of episodes of statistically significant two- and three-point correlations in the returns of several leading currency exchange rates that could offer so…
New metrics help predict Brownian motion on surfaces and higher dimensions.
problem Predicting Brownian motion on complex surfaces and higher dimensions.
method Developed new metrics (Uniform Drainage Metric) for surfaces and higher dimensions.
result Uniform Drainage Metric predicts Brownian motion's narrow escape time consistently.
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.
Optimal control of reserve assets for stablecoins to maintain peg stability.
problem Balancing immediate liquidity and yield on reserve assets for stablecoin peg maintenance.
method Developed a stochastic model predictive control framework with moment closure for event intensities, incorporating a soft-thresholding structure for rebalancing.
result Optimal policy shifts predictably toward cash as expected outflows intensify or windows lengthen, preserving most bill carry in calm markets and quickly building cash during stress.
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.
Improved online neural transducer model matches non-streaming model performance.
problem Significant performance degradation of online neural transducer models.
method Increased attention window, LAS initialization, stronger language models.
result Improved online neural transducer model matches non-streaming model performance.
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.
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.