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

72145217289 · Jun 202019922001200920172026
48 results for reversible architectures

PETRA enables parallel training of deep models with reversible architectures.

problem Challenges in parallelizing deep model training.
method Introduces PETRA, a novel approach for parallelizing gradient computations in reversible architectures.
result Achieves competitive accuracies on CIFAR-10, ImageNet32, and ImageNet using ResNet models.

Recently, deep residual networks have been successfully applied in many computer vision and natural language processing tasks, pushing the state-of-the-art performance with deeper and wider architectures. In this work, we interpret deep residual networks as ordinary differential equations (ODEs), which have long been s…

2017-09-12abs ↗pdf ↗

New ODE solvers improve training efficiency and accuracy.

problem Training Neural ODEs requires efficient and accurate gradient calculation.
method Presented algebraically reversible ODE solvers that are time and memory efficient, calculate exact gradients, and are numerically stable.
result Reversible solvers strictly improve upon previous architectures in efficiency and accuracy.

SARD improves deep learning clinical prediction performance.

problem Deep learning models struggle to match linear models in healthcare predictions.
method Reverse Distillation to initialize deep models, combined with contextual and temporal embeddings.
result SARD outperforms state-of-the-art methods on clinical prediction outcomes.

Tuning hyperparameters of learning algorithms is hard because gradients are usually unavailable. We compute exact gradients of cross-validation performance with respect to all hyperparameters by chaining derivatives backwards through the entire training procedure. These gradients allow us to optimize thousands of hyper…

2015-02-11abs ↗pdf ↗

Intelligent Momentum Transformer outperforms traditional trading strategies.

problem Improving time-series momentum and mean-reversion trading strategies.
method Attention-based deep-learning architecture (Momentum Transformer) combining attention and LSTM.
result Momentum Transformer outperforms benchmarks and adapts to new market regimes.

No methods currently exist for making arbitrary neural networks fair. In this work we introduce GRAD, a new and simplified method to producing fair neural networks that can be used for auto-encoding fair representations or directly with predictive networks. It is easy to implement and add to existing architectures, has…

2018-07-01abs ↗pdf ↗

This paper studies deep learning methodologies for portfolio optimization in the US equities market. We present a novel residual switching network that can automatically sense changes in market regimes and switch between momentum and reversal predictors accordingly. The residual switching network architecture combines …

2019-10-16abs ↗pdf ↗

Classifies reversible and strongly reversible elements in quaternionic groups.

problem Classifying reversible and strongly reversible elements in quaternionic groups.
method Proves elements are reversible if and only if they are products of skew-involutions (resp. involutions).
result Proves elements are reversible if and only if they are products of skew-involutions (resp. involutions).

A new trading strategy using reinforcement learning for statistical arbitrage.

problem Traditional statistical arbitrage models rely on model assumptions and price deviations from a long-term mean.
method Empirical reversion time metric, reinforcement learning framework, and state space optimization.
result Optimal mean reversion strategy identified through reinforcement learning.

Algebraic method reveals criterion for quaternionic Möbius group reversibility.

problem Characterizing reversibility in quaternionic Möbius group elements.
method Purely algebraic approach using matrix entries and conjugacy invariants.
result Explicit criterion for reversibility in terms of matrix entries.

A Finsler space is said to be geodesically reversible if each oriented geodesic can be reparametrized as a geodesic with the reverse orientation. A reversible Finsler space is geodesically reversible, but the converse need not be true. In this note, building on recent work of LeBrun and Mason, it is shown that a geodes…

2004-07-29abs ↗pdf ↗

We introduce graph normalizing flows: a new, reversible graph neural network model for prediction and generation. On supervised tasks, graph normalizing flows perform similarly to message passing neural networks, but at a significantly reduced memory footprint, allowing them to scale to larger graphs. In the unsupervis…

2019-05-30abs ↗pdf ↗

Sharp stability results for reverse isoperimetric inequalities in 2D.

problem Reverse isoperimetric inequalities in the plane.
method Stability analysis of λ\lambda-convex bodies and convex bodies with smooth boundaries.
result Sharp stability results for reverse isoperimetric inequalities, including inradius and Cheeger inequalities.

Let GG be a group. An element gg in GG is called reversible if it is conjugate to g1g^{-1} within GG, and called strongly reversible if it is conjugate to its inverse by an order two element of GG. Let HHn\textbf{H}_{\mathbb H}^n be the nn-dimensional quaternionic hyperbolic space. Let PSp(n,1)\mathrm{PSp}(n,1) be the i…

2019-03-10abs ↗pdf ↗

On-line portfolio selection has attracted increasing interests in machine learning and AI communities recently. Empirical evidences show that stock's high and low prices are temporary and stock price relatives are likely to follow the mean reversion phenomenon. While the existing mean reversion strategies are shown to …

2012-06-18abs ↗pdf ↗

Conditional diffusion models can approximate target distributions well with Gaussian-mixture reverse kernels.

problem Approximating target distributions in conditional diffusion models.
method Using finite Gaussian mixtures with ReLU-network logits as reverse kernels, reducing the problem to static conditional density approximation.
result The resulting neural reverse-kernel class is dense in conditional KL divergence under exact terminal matching.

The paper classifies reversible elements in Seifert-fibered spaces and braid groups.

problem Classifying reversible elements in Seifert-fibered spaces and braid groups.
method Classification of reversible elements in Fuchsian groups, application to Seifert-fibered groups, and analysis of 3-torsion elements.
result Classification and analysis of reversible and 3-torsion elements in Seifert-fibered spaces and braid groups.

New findings show score matching's accuracy doesn't ensure numerical stability in diffusion sampling.

problem Numerical stability issues in diffusion sampling despite small forward-marginal error.
method Constructing a smooth score field with arbitrarily small forward-marginal L2L^2 error, showing nonexplosive behavior and moments of every order.
result Euler--Maruyama discretizations can converge in probability even when moments diverge, demonstrating failure of weak convergence.

TRS-ODENs learn dynamics with time-reversal symmetry for more efficient learning.

problem Learning dynamics with time-reversal symmetry for more efficient learning.
method Proposed a loss function and a new framework (TRS-ODENs) to learn dynamics efficiently.
result TRS-ODENs can learn dynamics from noisy and complex trajectories efficiently.

Paper proves rigidity theorems for geodesically reversible Finsler metrics.

problem Understanding geodesically reversible Finsler metrics in closed manifolds.
method Applied theory of volumes and areas on Finsler spaces to establish rigidity theorems.
result Partial explanation of the scarcity of geodesically reversible Finsler metrics in closed manifolds.

Reduces identity testing of reversible Markov chains to simpler symmetric chain tests.

problem Testing identity of reversible Markov chains from a single trajectory.
method Using lumping-congruent Markov embeddings, the problem is simplified to testing symmetric chains over a larger state space.
result Achieves state-of-the-art sample complexity for identity testing.

Auto-encoders have emerged as a successful framework for unsupervised learning. However, conventional auto-encoders are incapable of utilizing explicit relations in structured data. To take advantage of relations in graph-structured data, several graph auto-encoders have recently been proposed, but they neglect to reco…

2019-05-26abs ↗pdf ↗

Study neural architectures on learned latent graphs using Schrödinger dynamics.

problem Understanding neural architectures on learned latent graphs.
method Optimizes over stratified moduli space of weighted graphs with Kähler-Hessian metric.
result Multilayer stationary networks are equivalent to global stationary problems on supra-graphs.

The study characterizes diffusion model generalization using data-dependent ridge manifolds.

problem Understanding where diffusion model-generated samples lie when not memorizing the training set.
method Introduced a time-dependent family of log-density ridge manifolds to characterize reverse-time inference.
result Generated samples evolve by a reach-align-slide mechanism, controlled by normal and tangential components of training error.

Model projection transfers convolutional network properties to feedforward networks.

problem Transferring properties between feedforward and convolutional networks.
method Unified node-level framework with tensor-valued activations, model projection.
result Projected CNN nodes inherit GFFN-style trainable structure.

Characterizes isometries between non-reversible Finsler manifolds.

problem Understanding isometries in non-reversible Finsler manifolds.
method Generalization of Myers-Nakai Theorem for Riemannian manifolds, modification of function spaces to accommodate asymmetric structure.
result Functional characterization of isometries between non-reversible Finsler manifolds.