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,657 papers · 148 categories

Trend · papers per month

174349523697 · Jun 202019922001200920172026
48 results for interactive tasks

A new method detects interactions in neural networks using topological analysis.

problem Detecting interactions between input features in neural networks.
method Topological analysis of neural network connectivity to quantify interaction strength.
result The PID algorithm outperforms state-of-the-art baselines in interaction detection tasks.

Improved model-based reinforcement learning for interactive dialogue tasks reduces sample needs and improves performance.

problem Limited data and high sample cost in interactive dialogue systems.
method Model-based actor-critic approach with an environment model and planner.
result 70 times fewer samples required compared to baseline model-free algorithm, with 2x better asymptotic performance.

MEI model improves knowledge graph completion by efficiently modeling interactions between embeddings.

problem Efficiently modeling interactions between knowledge graph embeddings to predict missing links.
method MEI divides embeddings into partitions and uses Tucker and block term formats to model interactions efficiently.
result Achieves state-of-the-art performance on link prediction tasks.

Interactive DR framework for comparing datasets.

problem Limited flexibility in existing DR methods for comparative analysis.
method Unified linear comparative analysis (ULCA) with interactive optimization and visualization.
result ULCA and optimization algorithm improve comparative analysis efficiency and flexibility.

Paper proposes a new method for predicting drug interactions using adversarial autoencoders.

problem Predicting drug interactions to prevent adverse events.
method Introduces adversarial autoencoders based on Wasserstein distances and Gumbel-Softmax relaxation to generate high-quality negative samples.
result Significant improvements in link prediction and DDI classification tasks.

Inspired by the immense success of deep learning, graph neural networks (GNNs) are widely used to learn powerful node representations and have demonstrated promising performance on different graph learning tasks. However, most real-world graphs often come with high-dimensional and sparse node features, rendering the le…

2019-08-19abs ↗pdf ↗

Interpreting neural networks is a crucial and challenging task in machine learning. In this paper, we develop a novel framework for detecting statistical interactions captured by a feedforward multilayer neural network by directly interpreting its learned weights. Depending on the desired interactions, our method can a…

2017-05-14abs ↗pdf ↗

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 ↗

Most existing text-to-image synthesis tasks are static single-turn generation, based on pre-defined textual descriptions of images. To explore more practical and interactive real-life applications, we introduce a new task - Interactive Image Editing, where users can guide an agent to edit images via multi-turn textual …

2018-12-20abs ↗pdf ↗

Multitask Gaussian process (MTGP) is powerful for joint learning of multiple tasks with complicated correlation patterns. However, due to the assembling of additive independent latent functions, all current MTGPs including the salient linear model of coregionalization (LMC) and convolution frameworks cannot effectively…

2018-08-03abs ↗pdf ↗

In this work we present the novel ASTRID method for investigating which attribute interactions classifiers exploit when making predictions. Attribute interactions in classification tasks mean that two or more attributes together provide stronger evidence for a particular class label. Knowledge of such interactions make…

2017-07-24abs ↗pdf ↗

BaGGLS models biological interactions using Bayesian shrinkage for interpretability.

problem Interpreting complex interactions in high-dimensional biological data.
method Bayesian group global-local shrinkage prior with variational approximation.
result BaGGLS outperforms other methods in interaction detection and scalability.

AI benchmarks evaluate football team performance using generative models.

problem Evaluating human performance in complex interactive tasks is error-prone and unreliable.
method Trained Conditional VRNN Model on player and ball tracking data to imitate and predict team interactions.
result Trained model as a useful benchmark for evaluating team performance in football.

FIVES generates high-order interactive features efficiently and effectively.

problem Automating the generation of high-order interactive features in tabular data.
method Formulates interactive feature generation as edge search on a feature graph, using a GNN and adjacency tensor.
result FIVES outperforms state-of-the-art methods in various datasets and real-world applications.

SurvFD and SurvSHAP-IQ provide interpretable survival models by analyzing feature interactions.

problem Non-additivity of hazard and survival functions limits standard additive explanation methods.
method SurvFD decomposes higher-order effects into time-dependent and time-independent components, extending Shapley interactions to time-indexed functions.
result SurvFD and SurvSHAP-IQ offer a new perspective on survival explanations, explicitly characterizing feature interactions.

Proposes MGMN for end-to-end graph similarity learning.

problem Lack of cross-level interactions in graph similarity learning.
method Multi-level graph matching network (MGMN) combining node-graph matching and siamese graph neural networks.
result MGMN outperforms state-of-the-art models on graph-graph classification and regression tasks.

We present an approach for building an active agent that learns to segment its visual observations into individual objects by interacting with its environment in a completely self-supervised manner. The agent uses its current segmentation model to infer pixels that constitute objects and refines the segmentation model …

2018-06-21abs ↗pdf ↗

CAN approximates explicit feature interactions for CTR prediction.

problem Learning explicit feature interactions from sparse features.
method Co-Action Network approximates explicit pairwise feature interactions without introducing too many additional parameters.
result CAN outperforms state-of-the-art CTR models and the cartesian product method.

New algorithm trains latent diffusion models using interacting particles.

problem Training latent diffusion models efficiently and accurately.
method Reformulate training as minimizing a free energy functional, then approximate with interacting particles.
result The new algorithm outperforms previous methods in experiments.

The paper proposes a new method to improve microcredit decisions by modeling sequential loan interactions.

problem Improving microcredit decision-making by addressing population bias and model generalization.
method The authors introduce a multi-stage interaction sequence (MSIS) method that models sequential loan interactions and uses a hierarchical attention module to leverage interaction information.
result The MSIS method effectively remedies population bias and improves model generalization on a real loan data set.

PHASE dataset simulates complex social interactions in physical environments.

problem Lack of datasets for evaluating physically grounded perception of complex social interactions.
method Created PHASE dataset of 2D animations with procedural generation and physics engine.
result SIMPLE model outperforms neural networks in recognizing complex social interactions.

In artificial intelligence, we often specify tasks through a reward function. While this works well in some settings, many tasks are hard to specify this way. In deep reinforcement learning, for example, directly specifying a reward as a function of a high-dimensional observation is challenging. Instead, we present an …

2019-06-06abs ↗pdf ↗

C-IP improves LLMs' query selection for interactive tasks by estimating uncertainty robustly.

problem Minimizing the number of queries for interactive LLMs.
method Conformal Information Pursuit (C-IP) using conformal prediction sets.
result C-IP achieves better predictive performance and shorter query-answer chains.

Modeling a sequence of interactions between users and items (e.g., products, posts, or courses) is crucial in domains such as e-commerce, social networking, and education to predict future interactions. Representation learning presents an attractive solution to model the dynamic evolution of user and item properties, w…

2018-12-06abs ↗pdf ↗

Recent studies have shown that neural models can achieve high performance on several sequence labelling/tagging problems without the explicit use of linguistic features such as part-of-speech (POS) tags. These models are trained only using the character-level and the word embedding vectors as inputs. Others have shown …

2019-09-29abs ↗pdf ↗

Learning by integrating multiple heterogeneous data sources is a common requirement in many tasks. Collective Matrix Factorization (CMF) is a technique to learn shared latent representations from arbitrary collections of matrices. It can be used to simultaneously complete one or more matrices, for predicting the unknow…

2018-11-28abs ↗pdf ↗

ReOPD uses pre-collected teacher trajectories to distill knowledge from multi-turn interactions.

problem The cost of fully online on-policy distillation for multi-turn interactions.
method ReOPD, an off-environment alternative that reuses pre-collected teacher trajectories as replayed prefixes, addressing the prefix trap and distribution shift.
result ReOPD preserves or improves OPD-level accuracy, uses zero tool calls, and is at least 4imes imes faster per training step.

Framework for joint inference of network topology and interaction types in heterogeneous systems.

problem Joint inference of network topology, multi-type interaction kernels, and latent type assignments in heterogeneous interacting particle systems.
method Three-stage approach: shared structure recovery, discrete interaction type identification, and matrix factorization.
result The method yields accurate reconstruction of underlying dynamics and is robust to noise.

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 ↗

In important applications involving multi-task networks with multiple objectives, agents in the network need to decide between these multiple objectives and reach an agreement about which single objective to follow for the network. In this work we propose a distributed decision-making algorithm. The agents are assumed …

2018-12-20abs ↗pdf ↗

Lifelong learning can be viewed as a continuous transfer learning procedure over consecutive tasks, where learning a given task depends on accumulated knowledge --- the so-called knowledge base. Most published work on lifelong learning makes a batch processing of each task, implying that a data collection step is requi…

2018-10-26abs ↗pdf ↗