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

Trend · papers per month

70140209279 · May 202619922001200920172026
48 results for length control

Proposes a differentiable STFT for more efficient optimization of hop length.

problem Efficient optimization of hop length in STFT for better temporal control.
method Introduces a differentiable version of STFT with continuous hop length.
result Improves optimization methods like gradient descent for STFT.

New bounds show transformers need longer training for length generalization.

problem Understanding when transformers can generalize to longer inputs.
method Analyzing different settings of transformers, providing quantitative bounds.
result Transformers need training data longer than previously thought for length generalization.

In all dimensions, we prove that the marked length spectrum of a Riemannian manifold (M,g)(M,g) with Anosov geodesic flow and non-positive curvature locally determines the metric in the sense that two close enough metrics with the same marked length spectrum are isometric. In addition, we provide a completely new stabilit…

2018-06-11abs ↗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 ↗

Suppose that MM is a 22-dimensional oriented Riemannian manifold, and let γγ be a simple closed curve on MM. Let mγm γ denote the curve formed by tracing γγ mm times. We prove that if mγm γ is contractible through curves of length less than LL, then γγ is contractible through curves of length less than LL. In …

2015-10-12abs ↗pdf ↗

Study on estimating unstable open-loop matrices from state trajectories.

problem System identification for stochastic continuous-time dynamics.
method Employing randomized control inputs to estimate unstable open-loop matrix.
result Estimation error decays with trajectory length, signal-to-noise ratio, and excitability.

A new control chart detects shifts in binary data streams quickly and reliably.

problem Early detection of small shifts in multiple binary data streams.
method Cumulative Standardized Binomial EWMA (CSB-EWMA) chart with exact variance derivation.
result Adaptive control limits ensure robust detection across different data distributions.

Bavard proved a duality theorem between commutator length and quasimorphisms. Burago, Ivanov and Polterovich introduced the notion of a conjugation-invariant norm which is a generalization of commutator length. Entov and Polterovich proved that Oh-Schwarz spectral invariants are subset-controlled quasimorphisms which a…

2016-06-06abs ↗pdf ↗

Neural network outperforms traditional methods in chaotic dynamics classification.

problem Classifying chaotic and regular dynamics of the Chirikov standard map.
method Trained a convolutional neural network on finite-length trajectories compared to traditional Lyapunov exponent computation.
result Neural network outperforms traditional methods for short periods, converging faster and more robustly.

Quantum Clustering is a powerful method to detect clusters in data with mixed density. However, it is very sensitive to a length parameter that is inherent to the Schrödinger equation. In addition, linking data points into clusters requires local estimates of covariance that are also controlled by length parameters. Th…

2019-02-14abs ↗pdf ↗

New Q-learning algorithms reduce regret in inventory control problems.

problem Efficiently learning optimal policies in inventory control problems with limited feedback.
method Proposed Elimination-Based Half-Q-Learning (HQL) and Full-Q-Learning (FQL) algorithms with theoretical regret bounds.
result HQL incurs ildeO(H3T) ilde{\mathcal{O}}(H^3\sqrt{ T}) regret, FQL incurs ildeO(H2T) ilde{\mathcal{O}}(H^2\sqrt{ T}) regret, independent of state and action space sizes.

BCI provides calibrated prediction intervals for time series forecasts.

problem Calibration of prediction intervals for time series forecasts.
method BCI wraps around any time series forecasting models and optimizes interval lengths using dynamic programming.
result BCI achieves long-term coverage under arbitrary distribution shifts and temporal dependence.

We obtain sharp estimates on the growth rate of stable commutator length on random (geodesic) words, and on random walks, in hyperbolic groups and groups acting nondegenerately on hyperbolic spaces. In either case, we show that with high probability stable commutator length of an element of length nn is of order $n/\l…

2010-08-29abs ↗pdf ↗

Metric spaces with upper curvature bounds have controlled Dehn functions.

problem Understanding the relationship between curvature bounds and Dehn functions in metric spaces.
method Proving equivalence between upper curvature bounds and bounded Dehn functions using ultralimits and minimal discs.
result A length space has curvature bounded above by κ if and only if its Dehn function is bounded by the model surface of constant curvature κ.

The paper develops algorithms to minimize queue length regret in a communication system.

problem Minimizing the difference between actual and optimal queue lengths over time slots.
method Introduces queue length regret and applies algorithms from stochastic multi-armed bandit problem to analyze system performance.
result Order optimal O(1)O(1) queue length regret can be achieved with queue-length based policies.

HiDe learns hierarchical control for complex tasks by separating planning and control.

problem Solving long horizon control tasks with generalization to unseen scenarios.
method Functional decomposition of state-action spaces, RL-based planner, modular transfer of policy layers.
result Generalizes across unseen test environments and scales to longer horizons.

A learning-based algorithm optimizes admission control in a queuing system.

problem Optimizing admission decisions in a queuing system with unknown parameters.
method Proposes a learning-based dispatching algorithm to minimize regret compared to optimal policies.
result Achieves optimal regret bounds for different scenarios of unknown parameters.

Harmonic functions of two variables are exactly those that admit a conjugate, namely a function whose gradient has the same length and is everywhere orthogonal to the gradient of the original function. We show that there are also partial differential equations controlling the functions of three variables that admit a c…

2012-05-30abs ↗pdf ↗

Optimal inequalities found between Riemannian and Hilbert metrics in convex projective domains.

problem Finding optimal bounds between Riemannian and Hilbert metrics in convex projective domains.
method Optimal control techniques applied to Riemannian metrics induced by centro-affine hypersurface immersions.
result Optimal inequalities between Riemannian and Hilbert metrics for a class of convex projective domains.

Given a geometrically finite hyperbolic cone-manifold, with the cone singularity sufficiently short, we construct a one parameter family of cone-manifolds decreasing the cone angle to zero. We also control the geometry of this one parameter family via the Schwarzian derivative of the projective boundary and the length …

2002-11-26abs ↗pdf ↗

Study improves queue length estimation from connected vehicles by filtering parameters.

problem Large errors in estimated queue lengths at low market penetration rates.
method Used Kalman and Particle filters as multilevel real-time estimators.
result Filters reduce estimation errors and improve accuracy within 15 minutes.

We prove that any Riemannian two-sphere with area at most 1 can be continuously mapped onto a tree in a such a way that the topology of fibers is controlled and their length is less than 7.6. This result improves previous estimates and relies on a similar statement for Riemannian two-disks.

2014-01-28abs ↗pdf ↗

For training the sequence-to-sequence voice conversion model, we need to handle an issue of insufficient data about the number of speech pairs which consist of the same utterance. This study experimentally investigated the effects of Mel-spectrogram augmentation on training the sequence-to-sequence voice conversion (VC…

2020-01-06abs ↗pdf ↗

We study a coarse homology theory with prescribed growth conditions. For a finitely generated group G with the word length metric this homology theory turns out to be related to amenability of G. We characterize vanishing of a certain fundamental class in our homology in terms of an isoperimetric inequality on G and sh…

2008-09-19abs ↗pdf ↗

New bounds on efficiency for conformalized regression methods.

problem Efficiency of conformal prediction in regression models.
method Non-asymptotic bounds on prediction set length for conformalized quantile and median regression.
result Identifies phase transitions in convergence rates across different regimes of miscoverage level.

Driver identification has emerged as a vital research field, where both practitioners and researchers investigate the potential of driver identification to enable a personalized driving experience. Within recent years, a selection of studies have reported that individuals could be perfectly identified based on their dr…

2019-09-09abs ↗pdf ↗

This paper tackles adaptive control of unknown Markov jump systems with sample complexity and regret bounds.

problem Adaptive control of unknown Markov jump systems with changing dynamics.
method Identification-based adaptive control using a system identification algorithm and certainty equivalent control.
result The proposed adaptive control scheme achieves O(T)\mathcal{O}(\sqrt{T}) regret, improving to O(polylog(T))\mathcal{O}(polylog(T)) with partial knowledge.

Algorithm minimizes regret and converges to equilibria in Markov games.

problem Regret minimization and convergence to equilibria in general-sum Markov games under adversarial opponents.
method Decentralized algorithm that uses policy optimization and controls path length to achieve sublinear regret.
result Sublinear regret guarantees for convergence to correlated equilibrium in Markov games.

We prove 3-dimensional hyperbolic cone-manifolds are geometrically inflexible: a cone-deformation of a hyperbolic cone-manifold determines a bi-Lipschitz diffeomorphism between initial and terminal manifolds in the deformation in the complement of a standard tubular neighborhood of the cone-locus whose pointwise bi-Lip…

2014-12-15abs ↗pdf ↗

Optimal control problems on Riemannian manifolds are solved by penalizing constraint violations.

problem Optimal control problems with velocity constraints on Riemannian manifolds.
method Penalizing constraint violations and showing convergence to hard-constrained solutions.
result Solutions to soft-constrained problems converge to solutions of hard-constrained problems as penalty parameter increases.

Synthetic splitting theorem for Lorentzian spaces with non-negative curvature.

problem Proving a splitting theorem for globally hyperbolic Lorentzian length spaces with non-negative timelike curvature.
method Synthetic approach using triangle comparison and parallelity of timelike lines.
result Establishes a splitting of a neighborhood of a complete timelike line, leading to global inextendibility.

Machine learning improves learning and memory retention by optimizing study sessions.

problem Improving learning and memory retention methods for factual material.
method Large-scale randomized controlled trial with machine learning optimization of study sessions.
result Study sessions optimized with machine learning lead to 67% longer retention and 50% higher return rate.

The performance of many algorithms in the fields of hard combinatorial problem solving, machine learning or AI in general depends on tuned hyperparameter configurations. Automated methods have been proposed to alleviate users from the tedious and error-prone task of manually searching for performance-optimized configur…

2019-06-18abs ↗pdf ↗

The classic N p chart gives a signal if the number of successes in a sequence of inde- pendent binary variables exceeds a control limit. Motivated by engineering applications in industrial image processing and, to some extent, financial statistics, we study a simple modification of this chart, which uses only the most …

2010-01-12abs ↗pdf ↗

Algorithm learns linear systems from partial observations with near-optimal rate.

problem Identifying linear dynamical systems from partial observations, especially those with long-term memory.
method Multi-scale low-rank approximation using SVD on Hankel matrices of increasing sizes, combined with Fourier domain concentration bounds.
result Near-optimal rate of $\widetilde O\left(\sqrt\frac{d}{T} ight)$ in H2\mathcal{H}_2 error, with logarithmic dependence on memory length.

We considered an extension of the standard functional for the Einstein-Dirac equation where the Dirac operator is replaced by the square of the Dirac operator and a real parameter controlling the length of spinors is introduced. For one distinguished value of the parameter, the resulting Euler-Lagrange equations provid…

2006-03-29abs ↗pdf ↗