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.

169,291 papers · 148 categories

Trend · papers per month

8.0%16.0%23.9%31.9% · Jun 201919922001200920182026
48 results for multiple states

New method estimates state-action stationary distribution for better off-policy policy evaluation.

problem Accurately estimating state-action stationary distribution for off-policy policy evaluation.
method Estimated Mixture Policy (EMP) for state and state-action stationary distribution corrections.
result Empirical validation shows improved accuracy over state-of-the-art methods.

Study learns dynamics of linear systems from multiple short trajectories.

problem Learning dynamics of autonomous linear systems from multiple short trajectories.
method Finite sample analysis for stable and unstable systems, adjusting trajectory length for marginally stable systems.
result Learning rate of O(1N)\mathcal{O}(\frac{1}{\sqrt{N}}) for both stable and unstable systems.

Model aggregates answers with peer predictions, inferring world states.

problem Aggregating answers from multiple respondents without assuming consensus correctness.
method Probabilistic model incorporating respondent signals and predictions.
result Model infers world states and respondent expertise, outperforming other models.

Model classifies environment sounds using multiple feature channels and attention mechanisms.

problem Environment sound classification task.
method Multiple feature channels (MFCC, GFCC, CQT, Chromagram) and attention mechanism in a deep CNN.
result Achieves state-of-the-art performance on three benchmark datasets.

Researchers solve a complex financial control problem with explicit policies.

problem Constrained LQ control with multiplicative noise in financial risk management.
method Derived analytical control policy using state separation property and solving coupled Riccati equations.
result Explicit piece-wise affine control policy for optimal control of stochastic systems.

MAMBA learns policies competitive with multiple conflicting oracles.

problem Learning policies from multiple conflicting oracles in reinforcement learning.
method MAMBA uses a gradient estimator in the style of GAE to optimize policies, leveraging demonstrations from multiple weak oracles.
result MAMBA outperforms the state-of-the-art in learning policies competitive with multiple conflicting oracles.

Most content-based image retrieval systems consider either one single query, or multiple queries that include the same object or represent the same semantic information. In this paper we consider the content-based image retrieval problem for multiple query images corresponding to different image semantics. We propose a…

2014-02-21abs ↗pdf ↗

New method uses fewer parameters to match state-of-the-art performance on multiple natural language tasks.

problem Efficiently adapting BERT for multiple tasks with fewer parameters.
method PALs (projected attention layers) for shared BERT model with task-specific parameters.
result Matches state-of-the-art performance on GLUE benchmark with 7 times fewer parameters.

Develops a learning model predictive controller for competitive racing.

problem Lack of exploration in state space and complexity in obstacle avoidance.
method Explores state space through multiple initializations and develops a new method for convex terminal set selection.
result Yields a richer terminal safe set and maintains convexity.

Paper addresses state estimation in sensor networks with intermittent data.

problem State estimation in sensor networks with packet dropouts and corrupted observations.
method Bayesian variational inference with a dual-mask generative model.
result The method effectively identifies system states and noise parameters.

The paper extends intensity models for limit order books using marked point processes.

problem Modeling intensity ratios in limit order books with state dependency and clustering.
method Developed a new model combining three multiplicative components for marked point processes.
result The new model outperforms other intensity-based methods in predicting market order signs and aggressiveness.

A new method for Gaussian filtering using gradient flows and Wasserstein metrics.

problem Approximating Gaussian and mixture-of-Gaussians filtering for complex systems.
method Variational approximation via gradient-flow representation on Wasserstein metric space.
result Competitive performance in posterior representation and parameter estimation for systems with multiplicative noise and multi-modal distributions.

The study proves analogues of the discrete isoperimetric inequality in hyperbolic geometry.

problem Finding the minimum perimeter for polygons with a fixed area in hyperbolic geometry.
method Proving analogues of the discrete isoperimetric inequality for cyclic and tangential polygons in hyperbolic geometry, considering both single and multiple polygons.
result Established two versions of the isoperimetric inequality for multiple polygons in hyperbolic geometry with certain area or perimeter restrictions.

DMClusts discovers multiple clusterings from multi-view data.

problem Finding multiple meaningful and diverse clusterings from multi-view data.
method Deep matrix factorization to gradually factorize multi-view data into representational subspaces and generate one clustering per layer, enforcing diversity through proximity minimization.
result DMClusts outperforms state-of-the-art multiple clustering solutions.

Introduces R-SSM for modeling multi-object dynamics with GNNs and normalizing flows.

problem Complex interactions and evolutions in multi-object systems are hard to model.
method Relational state-space model (R-SSM) using graph neural networks (GNNs) and normalizing flows.
result Empirically validated on synthetic and real datasets.

Paper proves multiplicative weight updates can train neural networks without learning rate tuning.

problem Vanishing and exploding gradients in gradient descent for compositional functions.
method Proves descent lemma for compositional functions using multiplicative weight updates and derives Madam optimizer.
result Madam optimizer trains state-of-the-art neural networks without learning rate tuning.

A new framework for deep learning from multiple experts tackles long-tailed data issues.

problem Training deep networks on imbalanced data distributions.
method Learning From Multiple Experts (LFME) framework, involving self-paced expert selection and curriculum instance selection.
result LFME achieves superior performance compared to state-of-the-art methods.

Framework for generating multiple clusterings from multi-view data.

problem Challenges in finding optimal clustering criteria and handling incomplete multi-view data.
method DiMVMC framework that optimizes multiple decoder deep networks to complete data views and generate shared representations.
result DiMVMC outperforms state-of-the-art competitors in generating multiple clusterings with high diversity and quality.

Proves simplicity of Lyapunov exponents for specific Anosov flows.

problem Proving all Lyapunov exponents have multiplicity 1 for certain Anosov flows.
method Perturbative results for flows, modification of eigenvalues, Markov partition, and simplicity criterion.
result In a C1C^1-open and CkC^k-dense set of Anosov flows, all Lyapunov exponents have multiplicity 1.

Model improves emotion recognition using multiple physiological signals.

problem Single physiological signal is insufficient for accurate emotion recognition.
method Fused multiple modal physiological signals (EEG, EMG, EOG) for emotion classification.
result Best classification accuracy of 94.42% on arousal and 94.02% on valence in two-class tasks.

The paper finds unique equilibrium states for geodesic flows on certain surfaces.

problem Analyzing geodesic flows on surfaces without focal points.
method Proving the existence of unique equilibrium states for specific potentials.
result There are unique equilibrium states for certain potentials, including geometric multiples of scalar less than 1.

Deep learning fuses multiple kernels for improved data characterization.

problem Combining multiple kernels for effective data characterization.
method Creates dense embeddings using kernel similarities, then uses a deep neural network to fuse them. Introduces kernel dropout regularization and expanded composition kernels.
result Achieves state-of-the-art performance in kernel fusion.

Study shows mean field games can have multiple solutions under certain conditions.

problem Analysis of mean field games with anti-monotone running costs.
method Examined an N+1N+1-player game and mean field game with state space {0,1}, considering a minimum jumping rate.
result Mean field game equation may have multiple solutions if a specific condition is met.

A method learns common bias for multiple low-variance tasks without hyper-parameter tuning.

problem Learning common bias for multiple low-variance tasks without manual tuning.
method Two variants of online learning methods (aggressive and lazy) that update bias after each datapoint or at the end of each task.
result Across-tasks regret bound derived for the method, showing faster rates for aggressive variant and standard rates for lazy variant.

New updates for β\beta-divergence in convolutional NMF are stable and consistent.

problem Improving the stability and consistency of NMF updates for convolutional data.
method Presented multiplicative updates for β\beta-divergence in closed form.
result The new updates are stable and consistent across common β\beta values.

Develops machine learning models for excited states of CH2NH2+.

problem Accurately predicting excited-state properties and couplings for CH2NH2+.
method Combines neural networks and kernel ridge regression, encoding electronic states in inputs.
result Improved accuracy in predicting excited-state properties and couplings.

Localized sketching improves matrix multiplication and ridge regression complexity.

problem Efficiently approximate matrix multiplication and ridge regression with limited data availability.
method Localized sketching matrices for block diagonal structure, reducing sample complexity.
result Localized sketching achieves sample complexity matching global sketching methods.