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

147294441588 · Jun 202019922001200920172026
48 results for Transient Iteration Complexity

New algorithm improves understanding of decentralized SBO transient iteration complexity.

problem Limited understanding of how network topology, data heterogeneity, and nested structures affect SBO.
method D-SOBA framework with two variants: D-SOBA-SO and D-SOBA-FO, providing non-asymptotic convergence analysis and transient iteration complexity.
result First theoretical understanding of how network topology, data heterogeneity, and nested structures influence decentralized SBO.

Deep RL agents suffer from transient non-stationarity, which ITER mitigates.

problem Transient non-stationarity in deep RL agents affects generalization.
method Iterated Relearning (ITER) transfers knowledge between networks to reduce non-stationarity.
result ITER improves deep RL agents' performance on generalization benchmarks.

Sharp pseudospectral bounds prevent transient amplification in coupled gradient descent.

problem Transient amplification in coupled gradient descent systems.
method Developed a sharp pseudospectral theory for block-triangular Jacobians, proving Kreiss constant bounds and matching minimax lower bounds.
result Obtained a finite-horizon iteration-complexity bound of O(K(J)2log(1/δ))O(K(J)^2 \log(1/δ)) for stochastic coupled descent.

Detects anomalies in astronomical time series data.

problem Identifying new and interesting transients in large astronomical surveys.
method Two novel methods: a probabilistic neural network and a Bayesian parametric model.
result Neural networks are less suitable for anomaly detection in time series data compared to parametric models.

New offline RL method handles average-reward MDPs with single-policy coverage.

problem Challenges in offline reinforcement learning due to distribution shift and non-uniform coverage.
method Develops an algorithm based on pessimistic discounted value iteration with quantile clipping.
result First fully single-policy sample complexity bound for average-reward offline RL.

A new kernel improves statistical surrogates for stochastic manifolds with diverse data.

problem Handling statistical surrogates for stochastic manifolds with heterogeneous data.
method A transient anisotropic kernel is introduced to improve statistical surrogates for stochastic manifolds with heterogeneous data.
result The transient anisotropic kernel provides a better representation of statistical dependencies in the learned probability measure.

Study non-rectangular robust MDPs for average-reward, finding optimal policies and transient values.

problem Non-rectangular robust Markov decision processes under average-reward criterion.
method Proves history-dependent policies are robust-optimal, introduces transient-value framework, constructs epoch-based policy.
result Existence and properties of robust optimal policies, transient value bounds.

New method decomposes Markov chain rewards into persistent and transient components.

problem Ambiguity in classical evaluation methods for Markov chains with reducible and periodic states.
method Minimal exact quotient by the real peripheral invariant subspace, decomposing rewards into persistent and transient components.
result Exact comparison with classical methods shows that the new decomposition reallocates the same information, making persistent modes explicit.

Study examines the training process of an unsupervised learning model for detecting gravitational-wave transient noise.

problem Transient noise in gravitational-wave detector data causes instability and signal overlap.
method Unsupervised deep learning with variational autoencoder and invariant information clustering applied to the Gravity Spy dataset.
result Training process of the unsupervised learning architecture is examined and reported.

We present RAPID (Real-time Automated Photometric IDentification), a novel time-series classification tool capable of automatically identifying transients from within a day of the initial alert, to the full lifetime of a light curve. Using a deep recurrent neural network with Gated Recurrent Units (GRUs), we present th…

2019-03-29abs ↗pdf ↗

Study solves utility maximization in a transient price impact market.

problem Utility maximization in a market with transient price impact.
method Developed a discrete-time model and removed market depth and resilience process restrictions.
result Solved the utility maximization problem without convexity of attainable portfolio values.

Novel method uses information theory to measure causal influences during transient neural events.

problem Characterizing network interactions during transient neural events.
method Structural Causal Models, Information Theory, Transfer Entropy, Dynamic Causal Strength, Relative Dynamic Causal Strength.
result Introduced a novel measure, relative Dynamic Causal Strength, with theoretical and empirical support.

Unsupervised learning classifies transient noise in gravitational wave detectors.

problem Transient noise interferes with gravitational wave signals, causing instability.
method Combines variational autoencoder and invariant information clustering.
result Consistent classification with Gravity Spy project labels.

We discuss an "extrinsic" property of knots in a 3-subspace of the 3-sphere S3S^3 to characterize how the subspace is embedded in S3S^3. Specifically, we show that every knot in a subspace of the 3-sphere is transient if and only if the exterior of the subspace is a disjoint union of handlebodies, i.e. regular neighbor…

2015-02-17abs ↗pdf ↗

The paper analyzes convergence in SGD with momentum and proposes a diagnostic test.

problem Detecting convergence in stochastic gradient descent with momentum.
method Analyzes the transient and stationary phases of SGD with momentum, constructs a statistical diagnostic test.
result The proposed diagnostic test effectively detects convergence in the stationary phase of SGD with momentum.

Optimal trading strategy adapts to signals in markets with price impact.

problem Optimal liquidation in markets with linear price impact and predictive signals.
method Formulated as a stochastic control problem, solved using probabilistic and convex analytic techniques.
result Explicit solution for optimal trading strategy in terms of SDEs.

We study a multiplicative transient price impact model for an illiquid financial market, where trading causes price impact which is multiplicative in relation to the current price, transient over time with finite rate of resilience, and non-linear in the order size. We construct explicit solutions for the optimal contr…

2015-01-08abs ↗pdf ↗

Study optimal execution in a transient price impact model with multiple traders.

problem Optimal execution among multiple traders with transient price impact.
method Analyzed NN-player optimal execution games in an Obizhaeva--Wang model with and without regularization. Derived equilibrium solutions and explained their behavior.
result Existence of equilibrium restored with a specific time-dependent cost on block trades, and equilibrium is tractable.

SMC analysis reveals key transient effects in macroeconomic ABM.

problem Analysis of complex ABMs is challenging and often relies on ad hoc methods.
method Statistical model checking (SMC) implemented through MultiVeStA.
result Clear contrast across parameter families in macro-financial and structural sweeps.

Random matrix theory explains transient signal detectability in early-stopped gradient flow.

problem Transient signal detectability in early-stopped gradient flow.
method Random matrix theory applied to gradient flow in a linear teacher-student setting.
result Transient Baik-Ben Arous-Péché (BBP) transition in learning dynamics due to anisotropy and noise.

We document a mechanism operating in complex adaptive systems leading to dynamical pockets of predictability (``prediction days''), in which agents collectively take predetermined courses of action, transiently decoupled from past history. We demonstrate and test it out-of-sample on synthetic minority and majority game…

2004-10-29abs ↗pdf ↗

Improves inverse uncertainty quantification for time-dependent data using PCA and deep neural networks.

problem Efficiently quantify model input uncertainties from time-dependent experimental data.
method Functional PCA for dimensionality reduction, deep neural networks for surrogate modeling, Bayesian neural networks for uncertainty estimation.
result The proposed method reduces the computational cost and improves the agreement with experimental data.

Bayesian BIC for multi-trial data improves VAR model order selection.

problem Optimal VAR model order selection for multi-trial event-based data.
method Derive and apply Bayesian Information Criterion (BIC) for multi-trial ensemble data.
result Multi-trial BIC successfully recovers real model order and estimates small model order.

Study efficient power iteration for tensor models, proving convergence under specific conditions.

problem Simultaneous alternating power iteration for fixed-order asymmetric rank-one spiked tensor models.
method Finite-iteration local theory, geometrically decaying transient, fixed-order multilinear noise event, warm-start mechanism.
result Convergence to the unique informative local fixed point under specific conditions.

New method corrects motion artifacts in MR images without paired data.

problem Lack of paired data for supervised training in deep learning for MR motion correction.
method Outlier-rejecting bootstrap subsampling and aggregation, using optimal transport cycleGAN.
result Outperforms existing deep learning methods in correcting motion artifacts from TSM.

This study examines how market makers balance risk and impact in foreign exchange markets.

problem Balancing risk management with market impact in foreign exchange markets.
method An intermediate scenario approach considering both instantaneous and permanent market impact components.
result Transient market impact is more prevalent than previously thought, challenging traditional market impact models.

Paper proposes a new descriptor for early trajectory characterization in matrix iterations.

problem Comparing early behavior of high-dimensional trajectories in nonlinear matrix iterations.
method Develops a two-channel fuzzy coordinate system using F-transform for compact representation.
result The descriptor achieves high R^2 values (mean = 0.6480) in approximating convergence lengths.

We study the problem of the optimal execution of a large trade in the presence of nonlinear transient impact. We propose an approach based on homotopy analysis, whereby a well behaved initial strategy is continuously deformed to lower the expected execution cost. We find that the optimal solution is front loaded for co…

2014-12-16abs ↗pdf ↗

Over the last decade, both the neural network and kernel adaptive filter have successfully been used for nonlinear signal processing. However, they suffer from high computational cost caused by their complex/growing network structures. In this paper, we propose two random Euler filters for complex-valued nonlinear filt…

2018-01-02abs ↗pdf ↗

Paper presents a deep learning framework for faster, more accurate nuclear reactor power prediction.

problem Inaccurate and inefficient modeling of nuclear reactor transients.
method Hybrid digital twin-focused multi-stage deep learning framework using feed-forward neural networks.
result Achieved remarkable accuracy (96% classification, 2.3% MAPE) with noise-enhanced simulated data.

Optimal trading strategy under market resistance and concave price impact model.

problem Optimal trading in a market with endogenous resistance and concave price impact.
method Modeling market resistance, deriving a stochastic Fredholm equation, proving existence and uniqueness, proposing an iterative scheme.
result Existence and uniqueness of optimal control under certain conditions, exponential convergence of iterative scheme.