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

61121182242 · Jun 202019922001200920172026
48 results for Online Interaction

Predicts student performance in interactive online question pools using GNNs.

problem Predicting student performance in interactive online question pools with evolving knowledge.
method Proposes R^2GCN, a GNN model for heterogeneous networks to predict student performance.
result Achieves higher accuracy in student performance prediction than traditional methods.

Interactive user interfaces need to continuously evolve based on the interactions that a user has (or does not have) with the system. This may require constant exploration of various options that the system may have for the user and obtaining signals of user preferences on those. However, such an exploration, especiall…

2018-12-01abs ↗pdf ↗

The rise in online social networking has brought about a revolution in social relations. However, its effects on offline interactions and its implications for collective well-being are still not clear and are under-investigated. We study the ecology of online and offline interaction in an evolutionary game framework wh…

2016-01-28abs ↗pdf ↗

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.

New framework converts offline to online estimation using black-box offline estimators.

problem Convert offline estimation algorithms to online estimation algorithms.
method Oracle-Efficient Online Estimation (OEOE) framework.
result Achieves near-optimal online estimation error via black-box offline estimators.

Loss Data Analytics is an interactive, online, freely available text. The idea behind the name Loss Data Analytics is to integrate classical loss data models from applied probability with modern analytic tools. In particular, we seek to recognize that big data (including social media and usage based insurance) are here…

2018-08-20abs ↗pdf ↗

Method detects interactions for better CTR prediction.

problem Predicting click-through rate with high-dimensional categorical features and time-varying interactions.
method Online Random Intersection Chains (ORIC) for detecting informative interactions.
result ORIC detects high-interpretability interactions that improve CTR prediction.

New method for online learning in interacting particle systems.

problem Parameter estimation in stochastic interacting particle systems.
method Stochastic approximation of gradient of asymptotic log likelihood using continuous observations.
result Convergence to stationary points of asymptotic log-likelihood under suitable assumptions.

LSTM improves cross-network recommendations by capturing user preference changes and irregular time intervals.

problem Offline cross-network recommender solutions fail to capture user preference changes and dynamic environments.
method Proposes a multi-layered LSTM network with attention mechanisms, higher order interactions, and time-aware gates.
result The model consistently outperforms state-of-the-art in accuracy, diversity, and novelty.

In many online applications interactions between a user and a web-service are organized in a sequential way, e.g., user browsing an e-commerce website. In this setting, recommendation system acts throughout user navigation by showing items. Previous works have addressed this recommendation setup through the task of pre…

2018-09-07abs ↗pdf ↗

Study estimates long-term effects of online advertising mechanisms on user behavior and revenue.

problem Estimating long-term treatment effects in online advertising systems.
method Modeling treatment effects as a stopped random walk, using experimental design, and statistical methods.
result Confidence intervals for long-term treatment effects constructed using statistical techniques.

Interactive applications incorporating high-data rate sensing and computer vision are becoming possible due to novel runtime systems and the use of parallel computation resources. To allow interactive use, such applications require careful tuning of multiple application parameters to meet required fidelity and latency …

2012-03-15abs ↗pdf ↗

Study shows effectiveness of offline RL in online RL tasks.

problem Improving online RL efficiency using offline RL data.
method Formalized framework for incorporating offline RL as online RL subroutines, introducing techniques to enhance effectiveness.
result Effectiveness of the framework depends on task nature, techniques greatly enhance effectiveness, and existing methods are ineffective.

RKT model improves knowledge tracing by considering exercise relations and student forget behavior.

problem Traditional KT models fail to consider both exercise relations and student forget behavior.
method RKT model uses relation-aware self-attention to incorporate exercise relations and student forget behavior.
result RKT model outperforms state-of-the-art KT methods on real-world datasets.

Recommender systems play a crucial role in mitigating the problem of information overload by suggesting users' personalized items or services. The vast majority of traditional recommender systems consider the recommendation procedure as a static process and make recommendations following a fixed strategy. In this paper…

2017-12-30abs ↗pdf ↗

Algorithm balances online and offline data for linear bandits.

problem Online learning with an offline dataset in linear bandits.
method Proposes a linear bandit algorithm that uses offline data early and increasingly favors exploration as the horizon grows.
result Establishes regret bounds showing competitive performance with both purely online and offline solutions.

Strategic feature manipulation helps learners identify meaningful variables in online regression settings.

problem Strategic feature manipulation poses a challenge for learners in online regression settings.
method Investigates how strategic feature manipulation by individuals can help learners recover meaningful features.
result Simple learner behavior can help accurately recover meaningful features and incentivize feature improvement.

New model for personalized online advertising with multi-user interaction.

problem Realistic online advertising scenarios with multiple users interacting simultaneously.
method Introduces Multi-User Contextual Cascading Bandit (MCCB) model and proposes UCBBP and AUCBBP algorithms.
result Proves UCBBP and AUCBBP achieve optimal regret bounds for multi-user context.

In this paper, we propose a deep, globally normalized topic model that incorporates structural relationships connecting documents in socially generated corpora, such as online forums. Our model (1) captures discursive interactions along observed reply links in addition to traditional topic information, and (2) incorpor…

2018-09-19abs ↗pdf ↗

Algorithm learns from offline data to improve performance in target environment.

problem Learning from offline data in a target environment with unknown shifts.
method Adaptive algorithm that uses offline data to improve performance when informative.
result Algorithm provably improves performance over purely online learning when offline data are informative.

KGRL uses reinforcement learning with knowledge graphs for better interactive recommendation.

problem Achieving responsiveness and accuracy in dynamic user-item interactions.
method KGRL combines reinforcement learning and knowledge graphs, using a local knowledge network and attention mechanism.
result KGRL outperforms state-of-the-art methods in simulated and real-world environments.

User response prediction makes a crucial contribution to the rapid development of online advertising system and recommendation system. The importance of learning feature interactions has been emphasized by many works. Many deep models are proposed to automatically learn high-order feature interactions. Since most featu…

2019-04-02abs ↗pdf ↗

Sample efficiency is critical in solving real-world reinforcement learning problems, where agent-environment interactions can be costly. Imitation learning from expert advice has proved to be an effective strategy for reducing the number of interactions required to train a policy. Online imitation learning, which inter…

2018-06-12abs ↗pdf ↗

Online Apprenticeship Learning aims to match expert performance without access to cost functions.

problem Learning an agent's policy to match expert performance in an MDP without cost function access.
method Combines mirror descent based no-regret algorithms for policy optimization and cost learning, with optimistic exploration.
result Derives an algorithm with O(K)O(\sqrt{K}) regret, practical for high-dimensional control problems.

A new dataset tracks user interactions and click responses in online marketplaces.

problem Lack of exposure data in recommender systems datasets.
method Proposes a novel dataset including slates and click responses, allowing more accurate likelihood models.
result Models using exposure data show more natural likelihood, reducing bias towards previously exposed items.

This work explains why online imitation learning improves faster than theory predicts.

problem Online imitation learning's empirical policy improvement speed exceeds theoretical predictions.
method The authors analyze online imitation learning with a convex, smooth, and non-negative loss function, proving policy improvement in expectation and high probability.
result Adopting a sufficiently expressive policy class in online IL increases both policy improvement speed and performance bias.

Algorithm learns robust equilibrium in online Markov games with interactive data.

problem Sim-to-real gap in reinforcement learning.
method Distributionally robust RL with minimum value assumption, least square value iteration.
result Sample-efficient algorithm for robust equilibrium in online Markov games.

A new reinforcement learning framework separates users into risk-tolerant and risk-averse groups for better performance.

problem Improving performance for risk-averse users in reinforcement learning.
method Introducing a tiered reinforcement learning approach with two policies: πextOπ^{ ext{O}} and πextEπ^{ ext{E}}.
result Achieving constant regret for risk-averse users, independent of the number of episodes.

New RL approach learns dynamic VCG mechanisms in unknown MDP environments.

problem Learning dynamic VCG mechanisms in unknown MDP environments.
method Reward-free online RL for exploration, combined with function approximation.
result Regret bound of O~(T2/3)\tilde{\mathcal{O}}(T^{2/3}) for dynamic VCG mechanism learning.

A3RL combines online and offline RL with active sampling to improve policy learning.

problem Combining online and offline RL for sample efficiency and robustness.
method A3RL uses a confidence-aware Active Advantage Aligned (A3) sampling strategy to prioritize data from both online and offline sources.
result A3RL outperforms competing online RL techniques that use offline data.

We study the problem of online influence maximization in social networks. In this problem, a learner aims to identify the set of "best influencers" in a network by interacting with it, i.e., repeatedly selecting seed nodes and observing activation feedback in the network. We capitalize on an important property of the i…

2019-06-09abs ↗pdf ↗

Paper proposes a hybrid RL algorithm that combines offline and online data without needing reward info.

problem How to efficiently use online data to improve RL policies using only offline data.
method A three-stage hybrid RL algorithm that uses reward-agnostic exploration and model-based offline RL.
result The hybrid RL algorithm outperforms both pure offline and pure online RL in sample complexity.

Collaborative filtering (CF) allows the preferences of multiple users to be pooled to make recommendations regarding unseen products. We consider in this paper the problem of online and interactive CF: given the current ratings associated with a user, what queries (new ratings) would most improve the quality of the rec…

2012-10-19abs ↗pdf ↗

AriaNN enables private deep learning with minimal interaction and reduced key sizes.

problem Private deep learning with minimal interaction and reduced key sizes.
method Semi-honest 2-party computation protocol with function secret sharing, optimized primitives for neural network operations.
result Efficient private comparison for ReLU operations with reduced key size and improved performance.