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

57115172229 · May 202619922001200920172026
48 results for concurrent control

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.

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 ↗

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.

DeepFDR uses deep learning for better FDR control in neuroimaging data.

problem Spatial dependence among voxel-based tests in neuroimaging data.
method DeepFDR leverages unsupervised deep learning-based image segmentation.
result DeepFDR outperforms existing methods in FDR control and computational efficiency.

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.

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 ↗

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.

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.

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 ↗

MEC-Cox: A Machine-Learning-Assisted Generalized Entropy Calibration Method for Estimating ATT Marginal Hazard-Ratio

problem Estimating ATT marginal hazard-ratio in externally controlled survival trials
method Machine-learning-assisted generalized entropy calibration for IPW Cox regression
result Reduces bias, increases efficiency, and improves coverage

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.

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.

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.

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 ↗

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 ↗

Optimizes query routing to LLMs under cost and resource constraints.

problem Non-uniform or adversarial batching in per-query routing methods leads to cost inefficiency.
method Batch-level, resource-aware routing framework that jointly optimizes model assignment for each batch.
result Robust routing framework improves accuracy by 1-14% over non-robust methods.

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.

This work addresses unstable MeanFlow training by optimizing a coefficient in the loss function.

problem Unstable training of MeanFlow models with non-decreasing loss and unbounded gradient variance.
method Established a theory attributing the instability to misuse of the conditional velocity field, derived the optimal coefficient, and showed practical realizations.
result Optimal coefficient yields up to 54% improvement in sample quality and monotone FID trend.

Catastrophic forgetting occurs when a neural network loses the information learned in a previous task after training on subsequent tasks. This problem remains a hurdle for artificial intelligence systems with sequential learning capabilities. In this paper, we propose a task-based hard attention mechanism that preserve…

2018-01-04abs ↗pdf ↗

Max-rank improves multiple testing in conformal prediction.

problem Simultaneous testing of multiple hypotheses in scientific inquiries.
method Introduces max-rank, a novel correction for positive dependencies in simultaneous testing.
result Max-rank efficiently controls family-wise error rate and improves predictive uncertainty estimates.

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.

Given a similarity graph between items, correlation clustering (CC) groups similar items together and dissimilar ones apart. One of the most popular CC algorithms is KwikCluster: an algorithm that serially clusters neighborhoods of vertices, and obtains a 3-approximation ratio. Unfortunately, KwikCluster in practice re…

2015-07-17abs ↗pdf ↗

PolySwarm uses a swarm of LLMs to predict and arbitrage prediction markets.

problem Real-time prediction market trading and latency arbitrage inefficiencies.
method PolySwarm employs a swarm of 50 diverse LLMs, Bayesian combination, and risk-controlled execution.
result Swarm aggregation outperforms single-model baselines in prediction tasks.

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.

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 ↗

A new method creates simpler, more interpretable decision trees from complex ensembles.

problem Complex tree ensembles reduce interpretability and control over machine learning models.
method Dynamic-programming based algorithm for finding a minimum-size decision tree.
result Optimal born-again trees are simpler and more interpretable than original ensembles.

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.