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

19375674 · May 202619922001200920172026
48 results for Supremal Visitation Ratio

Study online RL with mismatched dynamics, achieving sublinear regret.

problem Exploration challenges in online RL with mismatched training and deployment dynamics.
method Introduce supremal visitation ratio, propose efficient algorithm with ff-divergence.
result Achieves sublinear regret in online RMDPs with optimal dependence on supremal visitation ratio and interaction episodes.

Two trees in the boundary of outer space are said to be \emph{primitive-equivalent} whenever their translation length functions are equal in restriction to the set of primitive elements of FNF_N. We give an explicit description of this equivalence relation, showing in particular that it is nontrivial. This question is …

2014-05-19abs ↗pdf ↗

New algorithm guarantees optimal convergence rate for stochastic optimization.

problem Optimal convergence rate for stochastic optimization algorithms.
method Regularized versions of Minimization by Incremental Surrogate Optimization (MISO) with arbitrary recurrent data sampling.
result Expected optimality gap converges at O(n1/2)O(n^{-1/2}) under general recurrent sampling schemes.

Robust learning method combines kernel smoothing and robust optimization.

problem Certifying robustness against distribution shifts in machine learning models.
method Adapting integral operator using supremal convolution for robustness, leveraging optimal transport.
result The method provides theoretical guarantees for certified robustness and competitive performance.

MedGraph learns patient visit embeddings from EMRs, capturing both attributes and temporal sequences.

problem Limited EMR embedding methods fail to capture patient demographics, utilisation, and code descriptions.
method MedGraph constructs an attributed bipartite graph and uses a point process to model temporal sequences.
result MedGraph outperforms state-of-the-art methods in medical risk prediction tasks.

Study automates detection of visitation disruptions in ICU patients.

problem Difficulty in detecting frequent visitation disruptions in ICU patients.
method Used DensePose R-CNN model to count people in video frames, analyzed disruptions and patient outcomes.
result Automated method detects visitation disruptions, impacts on pain and length of stay examined.

Computational models that forecast the progression of Alzheimer's disease at the patient level are extremely useful tools for identifying high risk cohorts for early intervention and treatment planning. The state-of-the-art work in this area proposes models that forecast by using latent representations extracted from t…

2019-04-17abs ↗pdf ↗

The paper introduces a new intrinsic reward method for exploration in reinforcement learning.

problem Improving exploration in reinforcement learning agents.
method Intrinsic rewards proportional to the entropy of future state-action features.
result The new objective leads to improved visitation of features within individual trajectories.

Successful attempts to predict judges' votes shed light into how legal decisions are made and, ultimately, into the behavior and evolution of the judiciary. Here, we investigate to what extent it is possible to make predictions of a justice's vote based on the other justices' votes in the same case. For our predictions…

2012-10-17abs ↗pdf ↗

The paper analyzes how over-parameterization affects reinforcement learning performance.

problem Understanding the impact of over-parameterization in reinforcement learning.
method Theoretical analysis of Least-Square Temporal Difference (LSTD) algorithm with random features and asymptotic regime.
result Identification of a double descent phenomenon in reinforcement learning performance.

The paper analyzes how SGD visits different regions of a non-convex problem's state space.

problem Understanding the long-run distribution of stochastic gradient descent in non-convex problems.
method Large deviations theory and randomly perturbed dynamical systems.
result The long-run distribution of SGD resembles the Boltzmann-Gibbs distribution with temperature equal to the step-size.

VisitHGNN predicts visit probabilities between neighborhoods and POIs using graph neural networks.

problem Estimating visit probabilities between neighborhoods and POIs for urban planning.
method Heterogeneous, relation-specific graph neural network (VisitHGNN) trained on mobility data.
result Strong predictive performance with high fidelity to observed travel behavior.

Inefficient markets allow investors to consistently outperform the market. To demonstrate that inefficiencies exist in sports betting markets, we created a betting algorithm that generates above market returns for the NFL, NBA, NCAAF, NCAAB, and WNBA betting markets. To formulate our betting strategy, we collected and …

2019-10-19abs ↗pdf ↗

We study the problem of off-policy policy optimization in Markov decision processes, and develop a novel off-policy policy gradient method. Prior off-policy policy gradient approaches have generally ignored the mismatch between the distribution of states visited under the behavior policy used to collect data, and what …

2019-04-17abs ↗pdf ↗

New RL approach uses future state and action visitation measures for better exploration.

problem Improving exploration in reinforcement learning.
method Intrinsic reward based on future state and action visitation measures, using contraction operators.
result Policies achieve good state-action space coverage and high performance.

New method stabilizes FQE by reweighting Bellman targets.

problem Stability guarantees for FQE often rely on Bellman completeness, which can fail with function approximation.
method Proposes stationary-weighted FQE, reweighting Bellman targets by stationary target-to-behavior density ratio.
result Proves finite-sample linear convergence to stationary projected Bellman fixed point without Bellman completeness.

Paper proposes machine learning model for early Alzheimer's diagnosis.

problem Early and accurate diagnosis of Alzheimer's Disease.
method Machine learning models, demographic, biomarker, and cognitive test data.
result 90% accuracy and 87% accuracy in predicting Alzheimer's development.

The paper develops personalized DAG models for web user behavior.

problem Understanding user behavior transitions between websites with user heterogeneity and network dependency.
method Personalized Binomial DAG models with network-structured covariates, embedding network structure into a dimension-reduced covariate, learning node neighborhoods, and exploring variance-mean relation.
result The proposed algorithm outperforms state-of-the-art competitors in heterogeneous data.

Given a positive function uW1,nu\in W^{1,n}, we define its John-Nirenberg radius at point xx to be the supreme of the radius such that Btlogun<ε0n\int_{B_t}|\nabla\log u|^n<ε_0^n when n>2n>2, and Btu2<ε02\int_{B_t}|\nabla u|^2<ε_0^2 when n=2n=2. We will show that for a collapsing sequence in a fixed conformal class under some curvature c…

2017-08-07abs ↗pdf ↗

We consider the off-policy estimation problem of estimating the expected reward of a target policy using samples collected by a different behavior policy. Importance sampling (IS) has been a key technique to derive (nearly) unbiased estimators, but is known to suffer from an excessively high variance in long-horizon pr…

2018-10-29abs ↗pdf ↗

Enhances early risk assessments for pediatric outcomes using contrastive learning.

problem Improving risk assessments in early stages of pediatric development.
method Contrastive multi-modal framework that treats each time window as a distinct modality, training on all available data.
result Consistent improvements in early-stage risk assessments validated on real-world tasks.

We show how to learn low-dimensional representations (embeddings) of patient visits from the corresponding electronic health record (EHR) where International Classification of Diseases (ICD) diagnosis codes are removed. We expect that these embeddings will be useful for the construction of predictive statistical models…

2018-03-26abs ↗pdf ↗

Modeling infection hotspots to quantify effects of contact tracing and testing.

problem Capturing the role of infection hotspots in disease transmission.
method Temporal point process modeling framework to represent visits and disease transmission.
result Estimation of transmission rates at sites and households using Bayesian optimization.

Improved off-policy evaluation for MDPs with weak distributional overlap.

problem Evaluation of policies when target and data-collection distributions are not strongly overlapping.
method Truncated Doubly Robust (TDR) estimators for off-policy evaluation in MDPs under weak distributional overlap.
result TDR estimators can recover large-sample behavior and are consistent even when distribution ratios are not square-integrable.

ConCare personalizes healthcare predictions by capturing EMR features.

problem Predicting patient outcomes from EMR data with personalization.
method Captures personal characteristics and time-aware distribution in EMR data.
result Improves healthcare prediction accuracy through personalized health context.

The paper introduces return parity for fairness in MDPs, addressing delayed and adverse effects.

problem Fairness in MDPs for dynamic domains with delayed and adverse effects.
method Proposes return parity, decomposes return disparity, and develops algorithms for state visitation distributional alignment.
result The proposed algorithms can successfully close the disparity gap while maintaining policy performance.

Algorithm optimizes constrained reinforcement learning with dual variables.

problem Minimizing convex functional subject to convex constraint in large state spaces.
method VPDPO algorithm using Lagrangian and Fenchel duality.
result Achieves sublinear regret and constraint violation, globally optimal policy.

Study how untrained policies explore in RL environments.

problem Challenges in reinforcement learning, especially sparse or adversarial reward structures.
method Theoretical and empirical analysis of untrained deep neural policies in a toy model.
result Untrained policies generate correlated actions and non-trivial state-visitation distributions.

A new approach for deep exploration in sparse reward reinforcement learning.

problem Slow or no learning in reinforcement learning with rare rewards.
method Long-term visitation count planning and decoupling exploration and exploitation.
result Significantly outperforms existing methods in sparse reward environments.

We present here a general framework and a specific algorithm for predicting the destination, route, or more generally a pattern, of an ongoing journey, building on the recent work of [Y. Lassoued, J. Monteil, Y. Gu, G. Russo, R. Shorten, and M. Mevissen, "Hidden Markov model for route and destination prediction," in IE…

2018-08-31abs ↗pdf ↗