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

Trend · papers per month

1.1%2.2%3.3%4.3% · Jun 199719922001200920172026
44 results for TPS

New method ensures consistent inference across different tensor parallel sizes for large language models.

problem Non-deterministic inference in large language models due to inconsistent reduction orders across GPUs.
method Tree-Based Invariant Kernels (TBIK) that align intra- and inter-GPU reduction orders through a unified hierarchical binary tree structure.
result Bit-wise identical results across different tensor parallel sizes for RL training.

This paper introduces Tree-Pyramidal Adaptive Importance Sampling (TP-AIS), a novel iterated sampling method that outperforms state-of-the-art approaches like deterministic mixture population Monte Carlo (DM-PMC), mixture population Monte Carlo (M-PMC) and layered adaptive importance sampling (LAIS). TP-AIS iteratively…

2019-12-18abs ↗pdf ↗

Paper generalizes reward distribution in multi-armed bandits with temporally-partitioned rewards.

problem Handling partial rewards distributed over multiple rounds in multi-armed bandits.
method Introduces Beta-spread property to generalize reward distribution, derives lower bound, and provides TP-UCB-FR-G algorithm.
result Improves regret upper bound for some scenarios using Beta-spread property.

New framework for identifying spatial data components using TP latent components.

problem Identifying complex dependencies in spatial data.
method Introduces a new nonlinear ICA framework with tt-process latent components and develops a learning and inference algorithm.
result Identifiability of TP independent components under general conditions and Gaussian Process limit.

Theoretical framework for target propagation shows differences from backpropagation.

problem Understanding and improving target propagation for neural networks.
method Mathematical optimization analysis and novel reconstruction loss.
result A novel reconstruction loss improves feedback weight training and introduces architectural flexibility.

Investigates energy minimizers and critical points of scale-invariant tangent-point energies for knots.

problem Finding and characterizing minimizers and critical points of scale-invariant tangent-point energies for closed curves.
method Develops convergence and regularity theories based on fractional Sobolev spaces and new energy functionals.
result Minimizing sequences converge to locally critical embeddings in all but finitely many points, and locally critical embeddings are regular.

We show that if a smooth multiplicative subbundle STGS\subseteq TG on a groupoid $G\rr P$ is involutive and satisfies completeness conditions, then its leaf space G/SG/S inherits a groupoid structure over the space of leaves of TPSTP\cap S in PP. As an application, a special class of Dirac groupoids is shown to project b…

2010-10-15abs ↗pdf ↗

Predictive coding networks are shown to be stable, robust, and converge faster than backpropagation.

problem Stability, robustness, and convergence of predictive coding networks.
method Dynamical systems theory and Lyapunov stability analysis.
result Predictive coding networks are Lyapunov stable and converge faster than backpropagation.

Paper characterizes gradient descent dynamics for neural networks with finite width.

problem Characterize gradient descent dynamics for multi-layer neural networks.
method Non-asymptotic state evolution theory for finite-width networks.
result Gradient descent dynamics provide precise distributional characterization.

This work improves Fourier pricing for multi-asset options using RQMC with domain transformation.

problem Efficiently pricing multi-asset options in high dimensions with Fourier methods.
method Randomized quasi-Monte Carlo (RQMC) with domain transformation to handle singularities.
result RQMC with domain transformation provides accurate and scalable Fourier pricing for multi-asset options.

Let EE be a principle bundle over a compact manifold MM with compact structural group GG. For any GG-invariant polynomial PP, The transgressive forms TP(ω)TP(ω) defined by Chern and Simons are shown to extend to forms ΦP(ω)ΦP(ω) on associated bundles BB with fiber a quotient F=G/HF=G/H of the group. These forms satisfy a …

2006-01-09abs ↗pdf ↗

For any principal bundle PP, one can consider the subspace of the space of connections on its tangent bundle TPTP given by the tangent bundle TAT{\cal A} of the space of connections A{\cal A} on PP. The tangent gauge group acts freely on TAT{\cal A}. Appropriate BRST operators are introduced for quantum field theori…

1997-06-23abs ↗pdf ↗

Let PP be a Laplace type operator acting on a smooth hermitean vector bundle VV of fiber CN\mathbb{C}^N over a compact Riemannian manifold given locally by P=[gμνu(x)μν+vν(x)ν+w(x)]P= - [g^{μν} u(x)\partial_μ\partial_ν+ v^ν(x)\partial_ν+ w(x)] where u,vν,wu,\,v^ν,\,w are MN(C)M_N(\mathbb{C})-valued functions with u(x)u(x) positive and invertible. F…

2017-07-30abs ↗pdf ↗

We discuss the spectral curves and rational maps associated with SU(2)SU(2) Bogomolny monopoles of arbitrary charge kk. We describe the effect on the rational maps of inverting monopoles in the plane with respect to which the rational maps are defined, and discuss the monopoles invariant under such inversion. We define t…

1994-07-18abs ↗pdf ↗

In the previous work, the first author established an algorithm to compute the Morse index and the nullity of an nn-periodic minimal surface in Rn\mathbb{R}^n. In fact, the Morse index can be translated into the number of negative eigenvalues of a real symmetric matrix and the nullity can be translated into the number…

2018-01-31abs ↗pdf ↗

New algorithm for multi-armed bandits with delayed, partially observed rewards.

problem Sequential decision-making with delayed feedback.
method Proposed multi-armed bandits with generalized temporally-partitioned rewards, introducing β-spread property.
result Upper bound on performance of TP-UCB-FR-G algorithm improves state of the art.

DP-SGD can update fewer coordinates while maintaining privacy.

problem How to update fewer coordinates in DP-SGD without losing optimization signal.
method TP-TopK (Two-Phase TopK DP-SGD), a two-phase method for coordinate-sparse private training.
result Private training can update fewer coordinates without losing optimization signal, scaling noise with active dimension \(k\) instead of full dimension \(d\).

Given a smooth hermitean vector bundle VV of fiber CN\mathbb{C}^N over a compact Riemannian manifold and \nabla a covariant derivative on VV, let P=(g1/2μg1/2gμνuν+pμμ+q)P = -(\lvert g \rvert^{-1/2} \nabla_μ\lvert g \rvert^{1/2} g^{μν} u \nabla_ν+ p^μ\nabla_μ+q) be a nonminimal Laplace type operator acting on smooth sections of VV wher…

2019-01-05abs ↗pdf ↗

This paper shows how deep neural networks can learn rich, independent features that significantly deviate from initialization.

problem Understanding how deep neural networks achieve meaningful feature learning and global convergence.
method Investigation of infinitely wide, LL-layer neural networks using the tensor program framework under Maximal Update parametrization.
result SGD enables these networks to learn linearly independent features that substantially deviate from their initial values, capturing relevant data information.

The paper defines connections on Lie groupoid bundles and their properties.

problem Defining connections on Lie groupoid bundles and their properties.
method Introducing a suitable definition for connections on Lie groupoid bundles and proving their existence.
result Existence of connections on Lie groupoid bundles and their properties.

The backpropagation (BP) algorithm is often thought to be biologically implausible in the brain. One of the main reasons is that BP requires symmetric weight matrices in the feedforward and feedback pathways. To address this "weight transport problem" (Grossberg, 1987), two more biologically plausible algorithms, propo…

2018-11-08abs ↗pdf ↗

A new approach simplifies multitask Gaussian processes without rank approximations.

problem Handling multioutput regression problems with conditionally dependent tasks.
method Introduces a novel approach to reduce multitask learning to univariate GPs, eliminating the need for rank approximations.
result Accurately recovers multitask covariance and noise matrices with fewer parameters, improving performance and reducing overfitting risk.