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

Trend · papers per month

134269403537 · Jun 202019922001200920172026
48 results for linear source transition

pLSTM tackles long-range language modeling and computer vision tasks with parallelizable linear source transition mark networks.

problem Challenges of existing recurrent architectures in handling sequences and multi-dimensional data.
method Introduces pLSTM, a parallelizable linear source transition mark network for linear graphs and DAGs, addressing vanishing/exploding activation/gradient issues.
result pLSTM outperforms Transformers in long-range tasks like arrow-pointing extrapolation and image size extrapolation.

In the following paper we investigate the question: when is a transitive topological groupoid continuously isomorphic to a Lie groupoid? We present many results on the matter which may be considered generalizations of the Hilbert's fifth problem to this context. Most notably we present a "solution" to the problem for p…

2018-05-06abs ↗pdf ↗

Paper analyzes latent space geometry in generative models using Fisher information.

problem Understanding the structure of latent spaces in generative models.
method Reconstructs Fisher information metric from generated samples and posterior distribution.
result Reveals fractal structure and abrupt changes in Fisher metric at phase boundaries.

The paper analyzes phase transitions in transfer learning for perceptrons.

problem Understanding when transfer learning from a source task to a target task is beneficial.
method Theoretical analysis of a pair of related perceptron learning tasks.
result Reveals a phase transition from negative to positive transfer as task similarity changes.

Let G be a Lie groupoid over M such that the target-source map from G to M x M is proper. We show that, if O is an orbit of finite type (i.e. which admits a proper function with finitely many critical points), then the restriction G|U of G to some neighborhood U of O in M is isomorphic to a similar restriction of the a…

2001-07-05abs ↗pdf ↗

Neural networks with DAGs show linearity as width increases.

problem Understanding linearity in neural networks with arbitrary DAG structures.
method Analyzing the transition to linearity in networks with arbitrary DAGs, characterizing width by minimum in-degree.
result General neural networks with DAGs exhibit linearity as width approaches infinity.

A new method for reinforcement learning that adapts to different domains using auxiliary classifiers.

problem Training reinforcement learning agents to perform well in different domains with varying dynamics.
method Learning auxiliary classifiers to distinguish source-domain from target-domain transitions and modifying the reward function accordingly.
result The approach improves transfer performance in reinforcement learning tasks with varying dynamics.

SCPO learns robust policies without modeling disturbance, improving real-world task performance.

problem Poor performance of reinforcement learning in real-world tasks due to disturbance in transition dynamics.
method State-conservative policy optimization (SCPO) that reduces disturbance to state space and approximates it with a gradient-based regularizer.
result SCPO learns robust policies without prior knowledge of disturbance or simulators, improving performance in robot control tasks.

The paper investigates non-linear and heavy-tailed predictability in transition-energy financial markets.

problem Incomplete representation of dependence structure in Gaussian-linear forecasting frameworks.
method Develops a hybrid forecasting framework combining Student-t Vector Autoregressions with nonlinear recurrent residual learning architectures.
result The proposed framework consistently improves predictive accuracy relative to conventional models, especially during macro-financial stress.

New algorithm reduces reinforcement learning regret for linear MDPs with unknown transitions.

problem Adversarial linear mixture MDPs with bandit feedback and unknown transition.
method Proposes a new algorithm with a least square estimator and self-normalized concentration.
result Achieves improved regret bound with high probability.

The notion of nn-transitivity can be carried over from groups of diffeomorphisms on a manifold MM to groups of bisections of a Lie groupoid over MM. The main theorem states that the nn-transitivity is fulfilled for all nNn\in\mathbb N by an arbitrary group of CrC^r-bisections of a Lie groupoid ΓΓ of class CrC^r, w…

2016-03-04abs ↗pdf ↗

RFMs transition from linear to nonlinear under specific input-label correlation.

problem Understanding the transition from linear to nonlinear behavior in RFMs.
method Analyzing RFMs under spiked covariance designs, characterizing the interaction between anisotropy and input-label correlation.
result The RFM generalization error is governed by the strength of input-label correlation, leading to a clear nonlinear advantage above a specific boundary.

A new method for ILO with transition model disparity using an intermediary policy.

problem Learning tasks from expert observations with different transition dynamics.
method Training an intermediary policy to match the state transitions of the expert dataset.
result Our method outperforms existing ILO approaches with transition model mismatch.

The paper tackles joint learning of linear systems, improving accuracy with pooled data.

problem Estimating transition matrices of multiple related linear systems more accurately.
method Developed novel techniques to bound estimation errors and establish high probability bounds for singular values.
result Significant gains in accuracy achieved by pooling data across systems.

In most sampling algorithms, including Hamiltonian Monte Carlo, transition rates between states correspond to the probability of making a transition in a single time step, and are constrained to be less than or equal to 1. We derive a Hamiltonian Monte Carlo algorithm using a continuous time Markov jump process, and ar…

2015-09-13abs ↗pdf ↗

UCB-TQL learns from multiple tasks with shared dynamics and adapts to task-specific variations.

problem Transfer reinforcement learning with composite MDPs where tasks share core dynamics but have sparse differences.
method UCB-TQL, a novel transfer RL algorithm for composite MDPs.
result Achieved a regret bound of ildeO(eH5N) ilde{O}(\sqrt{eH^5N}) that scales independently of the ambient dimension.

We describe a generalization of the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) which is able to encode prior information that state transitions are more likely between "nearby" states. This is accomplished by defining a similarity function on the state space and scaling transition probabilities by pai…

2017-07-21abs ↗pdf ↗

Wide neural networks become linear, but adding bottlenecks makes them bilinear or multilinear.

problem Understanding the transition of neural networks from linearity to higher-order functions.
method Analyzing the behavior of randomly initialized wide neural networks with and without bottleneck layers.
result Bottleneck layers transform the network's function from linear to bilinear or multilinear.

StrADiff separates sources from mixtures without labels, using structured priors.

problem Blind source separation of linear and nonlinear mixtures without labeled data.
method Structured Source-Wise Adaptive Diffusion Framework with Gaussian process priors.
result StrADiff can recover latent source trajectories in an unsupervised manner, especially stable in linear mixtures.

The paper analyzes how combining samples from two tasks can improve performance, especially in high dimensions.

problem Understanding when combining samples from two related tasks outperforms learning with one task alone.
method Applying random matrix theory to high-dimensional linear regression, focusing on proportional sample size increases.
result Precise high-dimensional asymptotics for bias and variance of HPS estimator, showing phase transitions in transfer performance.

Study shows optimal RL with transition look-ahead is NP-hard for 2\ell \geq 2.

problem Optimal reinforcement learning with transition look-ahead is computationally hard.
method Proved NP-hardness for 2\ell \geq 2 using linear programming.
result There is a precise boundary between tractable and intractable cases for RL with look-ahead.

SVM and linear regression models coincide in high dimensions.

problem Understanding the connection between SVM and linear regression in high-dimensional data.
method Analyzing feature models and proving lower bounds on dimensionality.
result A sharp phase transition in Gaussian feature models, with support vector proliferation occurring only in very high dimensions.

New algorithm reduces dynamic regret for MDPs with unknown transition and adversarial rewards.

problem Episodic linear mixture MDPs with unknown transition and adversarial rewards.
method Combines occupancy-measure-based global optimization and policy-based variance-aware value-targeted regression.
result Achieves near-optimal dynamic regret of O~(dH3K+HK(H+PˉK))\widetilde{\mathcal{O}}(d \sqrt{H^3 K} + \sqrt{HK(H + \bar{P}_K)}).

We give a polynomial-time algorithm for learning latent-state linear dynamical systems without system identification, and without assumptions on the spectral radius of the system's transition matrix. The algorithm extends the recently introduced technique of spectral filtering, previously applied only to systems with a…

2018-02-12abs ↗pdf ↗

The waggle dance that honeybees perform is an astonishing way of communicating the location of food source. After over 60 years of its discovery, researchers still use manual labeling by watching hours of dance videos to detect different transitions between dance components thus extracting information regarding the dis…

2017-05-20abs ↗pdf ↗

Wide neural networks become linear, with constant tangent kernel, due to Hessian scaling.

problem Understanding the linearity of large non-linear models and the tangent kernel.
method Analyzing the scaling properties of the Hessian matrix of neural networks as their width increases.
result The constancy of the tangent kernel is due to the scaling properties of the Hessian matrix.

Paper tackles robust decision-making from multiple sites with shared structure.

problem Learning robust sequential decisions from heterogeneous multi-site datasets.
method Group-Robust MDPs with d-rectangular uncertainty sets, feature-wise worst-case aggregation, and cluster-level pooling.
result Proves suboptimality bound for robust planning policy under robust partial coverage assumption.

We present a variational formulation of electrodynamics using de Rham even and odd differential forms. Our formulation relies on a variational principle more complete than the Hamilton principle and thus leads to field equations with external sources and permits the derivation of the constitutive relations. We interpre…

2007-04-03abs ↗pdf ↗

This research improves dynamical systems understanding by identifying latent states and their nonlinear transitions.

problem Previous work on dynamical systems could not identify nonlinear transition dynamics, leading to unreliable predictions.
method Proposes a state-space modeling framework using variational auto-encoders to identify latent states and their nonlinear transition functions.
result Demonstrates high accuracy in recovering latent state dynamics and future prediction accuracy.

We present a simple model of firm rating evolution. We consider two sources of defaults: individual dynamics of economic development and Potts-like interactions between firms. We show that such a defined model leads to phase transition, which results in collective defaults. The existence of the collective phase depends…

2009-04-28abs ↗pdf ↗

Efficient RL for linear MDPs with unknown transitions.

problem Long planning horizons and unknown state transitions in linear mixture MDPs.
method Horizon-free algorithm using weighted least squares with variance and uncertainty awareness.
result Achieves optimal regret up to logarithmic factors.

The paper estimates key metrics for linear models with Markov or hidden Markov sources.

problem Estimating free energy, mutual information, and MMSE for linear models with specific signal priors.
method Replica analysis in statistical physics, focusing on Markov and hidden Markov sources.
result The linear model with Markov or hidden Markov sources can be simplified into decoupled AWGN channels.

Unsupervised Domain Adaptation (DA) is used to automatize the task of labeling data: an unlabeled dataset (target) is annotated using a labeled dataset (source) from a related domain. We cast domain adaptation as the problem of finding stable labels for target examples. A new definition of label stability is proposed, …

2017-06-16abs ↗pdf ↗