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

3857711,1561,541 · Jun 202019922001200920172026
48 results for concurrent learning

A new reinforcement learning method for robots thinking and moving simultaneously.

problem Concurrent control in robotic systems where actions must be decided while the system is still evolving.
method Continuous-time Bellman equations, discretization aware of system delays, and architectural extension to deep reinforcement learning.
result The method successfully handles tasks requiring simultaneous decision-making and action execution.

BCO* improves BCO by concurrently training inverse dynamics and expert policy.

problem Efficiently learn from unlabeled demonstrations without requiring many initial interactions.
method Introduce BCO* that concurrently trains an inverse dynamics model and expert policy.
result BCO* eliminates the need for initial interactions and improves sample complexity.

Paper proposes a method to learn and exceed expert demonstrations in unknown reward environments.

problem Learning to outperform expert demonstrations in unknown reward environments.
method A novel concurrent reward and action policy learning approach with a stereo utility definition.
result The proposed method can outperform expert demonstrations in various environments.

This paper examines a generalized Kropina metric and its geometric properties.

problem Investigating geometric properties of a generalized Kropina metric.
method Analyzing a Finsler manifold with a concurrent π-vector field and examining the φφ-concurrent generalized Kropina change.
result The geodesic sprays of the original Finsler metric and the modified metric are never projectively related.

The paper studies Finsler spaces with semi-concurrent vector fields and their equivalence to Riemannian spaces.

problem Characterizing Finsler spaces with semi-concurrent vector fields.
method Analyzing various Finsler spaces and proving conditions for equivalence to Riemannian spaces.
result Various Finsler spaces (quasi-CC-reducible, C3C3-like, ChC^{h}-recurrent, P2P2-like) are equivalent to Riemannian spaces if they admit a semi-concurrent vector field.

A Ricci soliton (Mn,g,v,λ)(M^n,g,v,λ) on a Riemannian manifold (Mn,g)(M^n,g) is said to have concurrent potential field if its potential field vv is a concurrent vector field. In the first part of this paper we completely classify Ricci solitons with concurrent potential fields. In the second part we derive a necessary and suffic…

2014-07-10abs ↗pdf ↗

A Ricci soliton (M,g,v,λ)(M,g,v,λ) on a Riemannian manifold (M,g)(M,g) is said to have concurrent potential field if its potential field vv is a concurrent vector field. Ricci solitons arisen from concurrent vector fields on Riemannian manifolds were studied recently in \cite{CD2}. The most important concurrent vector field is …

2014-10-19abs ↗pdf ↗

In the present paper, we introduce and investigate the notion of a semi concurrent vector field on a Finsler manifold. We show that some special Finsler manifolds admitting such vector fields turn out to be Riemannian. We prove that Tachibana's characterization of Finsler manifolds admitting a concurrent vector field l…

2018-02-07abs ↗pdf ↗

Novel framework for data sharing and coordinated exploration in concurrent RL with non-identical environments.

problem Learning more data-efficient and better policies in concurrent RL with non-identical environments.
method Proposes a novel algorithmic framework that leverages causal inference via ANM-MM to extract model parameters and a new data sharing scheme based on similarity measures.
result Demonstrates superior learning speeds on various tasks and effectiveness of diverse action selection.

New algorithm trains neural nets on simple skills to learn complex tasks faster.

problem Learning complex tasks through simple imitation.
method Train neural networks on simple, easy-to-learn skills to accelerate learning of complex, hard-to-learn tasks.
result Consistently outperforms state-of-the-art baseline in training speed and performance.

We consider a team of reinforcement learning agents that concurrently operate in a common environment, and we develop an approach to efficient coordinated exploration that is suitable for problems of practical scale. Our approach builds on seed sampling (Dimakopoulou and Van Roy, 2018) and randomized value function lea…

2018-05-23abs ↗pdf ↗

New algorithm provably converges to second-order stationary points in NMF.

problem Understanding convergence to local minima in NMF.
method Multiplicative weight update dynamics, concurrent updates, and simplex reduction.
result Provable convergence to second-order stationary points.

Deep learning model classifies concurrent human interactions from WiFi data with high accuracy.

problem Classifying concurrent human interactions from WiFi data with high accuracy.
method Attention-BiGRU deep learning model using Multiple Input Multiple Output radio link.
result Maximum benchmark accuracy of 94% for a single subject-pair, 88% for ten subject pairs.

The present paper deals with an \emph{intrinsic} investigation of the notion of a concurrent ππ-vector field on the pullback bundle of a Finsler manifold (M,L)(M,L). The effect of the existence of a concurrent ππ-vector field on some important special Finsler spaces is studied. An intrinsic investigation of a particular…

2008-05-16abs ↗pdf ↗

We consider the problem of concurrent portfolio losses in two non-overlapping credit portfolios. In order to explore the full statistical dependence structure of such portfolio losses, we estimate their empirical pairwise copulas. Instead of a Gaussian dependence, we typically find a strong asymmetry in the copulas. Co…

2016-04-23abs ↗pdf ↗

In this paper, we completely classify almost Yamabe solitons on hypersurfaces in Euclidean spaces arisen from the position vector field. Some results of almost Yamabe solitons with a concurrent vector field and almost Yamabe solitons on submanifolds in Riemannian manifolds equipped with a concurrent vector field are al…

2017-11-13abs ↗pdf ↗

We generalize Matsumoto metrics with a special π-form and explore their geometric properties.

problem Exploring the geometric properties of generalized Matsumoto metrics with a special π-form.
method Considering a Finsler manifold with a concurrent π-vector field, we introduce a change in the metric and analyze its geometric properties.
result The generalized φ-Matsumoto metric can never be projectively related to the original metric.

A novel method optimizes variable-stiffness structures for better strength and weight.

problem Optimizing variable-stiffness structures for higher strength and lighter weight.
method A novel multi-stage concurrent topology optimization scheme combining DMO, S-BPTO, and CFAO.
result The method ensures better fibre angle convergence and stable optimization.

We study the equilibrium positions of three points on a convex curve under influence of the Coulomb potential. We identify these positions as orthotripods, three points on the curve having concurrent normals. This relates the equilibrium positions to the caustic (evolute) of the curve. The concurrent normals can only m…

2015-03-14abs ↗pdf ↗

The study confirms conjectures about normals to convex polytopes in 3D space.

problem Concurrent normals problem for convex polytopes in 3D.
method Analyzes the PL concurrent normals problem for convex polytopes, proving conjectures for specific cases.
result Polytopes in 3D have points with 10 normals from interior points, confirmed for all tetrahedra and triangular prisms.

New method uses surrogate outcomes and single-record data to improve suicide risk modeling.

problem Lack of historical information in single-record patients hinders modeling rare medical events.
method Hybrid framework combining supervised and unsupervised learning to integrate concurrent and single-record data.
result Single-record data and concurrent diagnoses provide valuable information for improving suicide risk modeling.

TransformerLSR models longitudinal, recurrent, and survival data jointly.

problem Joint modeling of longitudinal measurements, recurrent events, and survival data with dependencies.
method Transformer-based deep learning framework integrating deep temporal point processes and latent structure representation.
result TransformerLSR effectively models all three components simultaneously, demonstrating necessity and effectiveness through simulations and real-world data.

The paper discusses the impossibility of eliminating surplus intersections in Lagrangian submanifolds.

problem Can surplus intersections in Lagrangian submanifolds be eliminated by Hamiltonian isotopy?
method Analyzing the intersections and isotopies of Lagrangian submanifolds and auxiliary Lagrangians.
result Surplusection cannot be eliminated in several important situations, highlighting the need for better understanding.

A method for identifying NPWARX models with arbitrary domains using probabilistic mixture models.

problem Identifying hybrid system models with discontinuous maps.
method Probabilistic mixture model with a neural network for nonlinear partitioning and Expectation Maximization for parameter estimation.
result Demonstrated on a nonlinear piece-wise problem with discontinuous maps.

Study on vector fields on Lie groups reveals surprising algebraic coincidences.

problem Characterizing vector fields on Lie groups with Riemannian metrics.
method Algebraic and geometric analysis of left-invariant vector fields on nilpotent Lie groups.
result Spaces of Killing, one-harmonic, and conformal vector fields coincide with the center of the Lie algebra on nilpotent Lie groups.

We design a randomised parallel version of Adaboost based on previous studies on parallel coordinate descent. The algorithm uses the fact that the logarithm of the exponential loss is a function with coordinate-wise Lipschitz continuous gradient, in order to define the step lengths. We provide the proof of convergence …

2013-10-07abs ↗pdf ↗

In dialogues, an utterance is a chain of consecutive sentences produced by one speaker which ranges from a short sentence to a thousand-word post. When studying dialogues at the utterance level, it is not uncommon that an utterance would serve multiple functions. For instance, "Thank you. It works great." expresses bot…

2019-09-02abs ↗pdf ↗

New algorithms improve tensor CP decomposition under mild conditions.

problem Improving tensor CP decomposition with theoretical guarantees under mild incoherence conditions.
method Composite PCA and Concurrent Orthogonalization algorithms.
result Theoretical guarantees and practical superiority over existing methods.

Learning from demonstration has been widely studied in machine learning but becomes challenging when the demonstrated trajectories are unstructured and follow different objectives. This short-paper proposes PODNet, Plannable Option Discovery Network, addressing how to segment an unstructured set of demonstrated traject…

2019-11-01abs ↗pdf ↗

WAEs offer a statistical understanding of density estimation and error bounds.

problem Concurrent density estimation with neural network-induced transformations.
method Statistical analysis of WAEs focusing on upper bounds and error propagation.
result Established deterministic upper bounds on WAE errors and explored their resilience.

MeanFlow training is unstable due to misusing conditional velocity, leading to variance issues.

problem Unstable training of MeanFlow due to variance problems.
method Theoretical analysis and derivation of optimal coefficient in closed form.
result The optimal coefficient in MeanFlow training minimizes variance but not necessarily quality.

In federated learning, a central server coordinates the training of a single model on a massively distributed network of devices. This setting can be naturally extended to a multi-task learning framework, to handle real-world federated datasets that typically show strong statistical heterogeneity among devices. Despite…

2019-06-14abs ↗pdf ↗

In this work we describe a novel deep reinforcement learning architecture that allows multiple actions to be selected at every time-step in an efficient manner. Multi-action policies allow complex behaviours to be learnt that would otherwise be hard to achieve when using single action selection techniques. We use both …

2018-03-14abs ↗pdf ↗

A new ensemble learning method called Residual Likelihood Forests improves performance and reduces model size.

problem Improving machine learning classification performance with compact models.
method Sequential optimization of conditional likelihoods in a boosting-like framework, combining multiplicatively.
result Significant performance improvements and reduced model size compared to other ensemble methods.