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

Trend · papers per month

306089119 · Jun 202019922001200920172026
48 results for human-computer interaction

Paper proposes self-supervised method for accurate speaker diarization.

problem Speaker diarization without massive labeling effort.
method Introduces dynamic triplet loss and multinomial loss for audio-video synchronization.
result Best model yields +8% F1-score improvement and diarization error rate reduction.

New method extracts latent variables from process data using autoencoders.

problem Extracting useful information from diverse, noisy, and nonstandard response processes.
method Sequence-to-sequence autoencoder to compress response processes into standard numerical vectors.
result The latent variables extracted from response processes are useful for understanding complex skills.

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.

A novel multi-modal active learning approach using RL for engagement estimation.

problem Challenges in labeling multi-modal human data for accurate user state estimation.
method Deep reinforcement learning for optimal data selection and multi-modal data fusion.
result The proposed approach outperforms existing methods in engagement estimation.

Human computation or crowdsourcing involves joint inference of the ground-truth-answers and the worker-abilities by optimizing an objective function, for instance, by maximizing the data likelihood based on an assumed underlying model. A variety of methods have been proposed in the literature to address this inference …

2014-11-21abs ↗pdf ↗

WayDCM predicts trajectories considering long-term goals, improving accuracy.

problem Predicting future trajectories of dynamic agents in complex environments.
method WayDCM combines DCM and NN to predict intermediate goals and trajectories, considering long-term goals.
result WayDCM outperforms previous methods on the Waymo Open dataset.

Project extends emotion recognition database and trains neural networks for categorical and dimensional emotions.

problem Understanding and recognizing emotions for human-computer interaction, safety, and medical research.
method Training CNN + RNN models with emotion category and valence/arousal representations, comparing three model types.
result Categorical emotion recognition performance improves with combined model training.

Policy Gradient (PG) algorithms are among the best candidates for the much-anticipated applications of reinforcement learning to real-world control tasks, such as robotics. However, the trial-and-error nature of these methods poses safety issues whenever the learning process itself must be performed on a physical syste…

2019-05-08abs ↗pdf ↗

New privacy method for eye tracking data reduces correlations and maintains accuracy.

problem Privacy concerns in eye tracking data from VR/AR glasses.
method Transform-coding based differential privacy mechanism for eye movement data.
result Significant reductions in sample correlations and query sensitivities, providing high privacy without loss in accuracy.

The history of research in finance and economics has been widely impacted by the field of Agent-based Computational Economics (ACE). While at the same time being popular among natural science researchers for its proximity to the successful methods of physics and chemistry for example, the field of ACE has also received…

2018-01-24abs ↗pdf ↗

VDA improves disentanglement of latent representations in complex signals.

problem Learning disentangled and interpretable representations in nonstationary, high-dimensional time-evolving signals.
method Variational decomposition autoencoding (VDA) framework, incorporating signal decomposition, contrastive self-supervised task, and variational prior approximation.
result DecVAEs surpass state-of-the-art VAE-based methods in disentanglement quality and generalization.

People who design, use, and are affected by autonomous artificially intelligent agents want to be able to \emph{trust} such agents -- that is, to know that these agents will perform correctly, to understand the reasoning behind their actions, and to know how to use them appropriately. Many techniques have been devised …

2017-11-08abs ↗pdf ↗

The paper evaluates the importance of monotonicity in AI fairness across various fields.

problem Ensuring fairness in AI applications across criminology, education, health care, and finance.
method Theoretical reasoning, simulation, and extensive empirical analysis of monotonic neural additive models (MNAMs).
result Monotonicity is essential for fairness in AI ethics and society, especially in criminology, education, health care, and finance.

Proposes a bilinear form to efficiently represent high-order temporal action information.

problem Efficiently capturing subtle and precise actions in long videos.
method Low-rank frontal tensors and bilinear form for extracting high-order information.
result Bilinear form outperforms state-of-the-art methods on temporal action segmentation.

RAN model recognizes multiple activities from unlabeled sensor data.

problem Handling weakly labeled multi-activity data from wearable sensors.
method Recurrent Attention Networks (RAN) for sequential multi-activity recognition and localization.
result RAN model can infer multiple activities and determine activity locations from unlabeled data.

This paper uses LLMs to streamline industrial data-centric R&D cycles.

problem High costs in human, computational, and time resources in data-centric R&D.
method Explores how large language models can understand domain-specific requirements and automate R&D tasks.
result Promising results show potential for automating industrial data-centric R&D cycles.

Factorization Machine (FM) is a widely used supervised learning approach by effectively modeling of feature interactions. Despite the successful application of FM and its many deep learning variants, treating every feature interaction fairly may degrade the performance. For example, the interactions of a useless featur…

2019-02-26abs ↗pdf ↗

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.

InteractE improves link prediction in KGs by increasing feature interactions.

problem Improving link prediction in knowledge graphs by inferring missing links.
method Feature permutation, novel feature reshaping, circular convolution.
result InteractE outperforms ConvE on multiple KG datasets.

iKF method uncovers complex variable interactions for scientific discovery.

problem Limited interpretability of existing models in decision-making applications.
method Iterative Kings' Forests (iKF) method to uncover multi-order interactions.
result iKF provides strong interpretive power for explainable modeling.

Graph neural network predicts vehicle interactions and trajectories for autonomous driving.

problem Predicting future motion of vehicles in traffic scenes.
method Graph neural network that jointly predicts interaction modes and 5-second future trajectories.
result Jointly predicting trajectories and interaction modes leads to lower trajectory error.

A graph neural network detects beneficial feature interactions for recommender systems.

problem Feature interactions are crucial but not all are beneficial for recommendation accuracy.
method Graph neural network with L0 activation regularization for edge prediction.
result The model outperforms baselines and automatically identifies beneficial feature interactions.

We describe and extract time-ordered multibody interactions from complex systems.

problem Complex systems with temporal and multibody dependencies.
method Decompose multivariate Markov chains into time-ordered multibody interactions. Algorithm to extract interactions from data. Measure complexity of interaction ensembles.
result Robust and efficient algorithm to infer time-ordered multibody interactions from data.

Dropout regularizes against high-order interactions by canceling interaction rates.

problem Overfitting to high-order interactions in neural networks.
method Analyzes Dropout through the lens of interaction effects, showing how it effectively cancels out the probability of surviving interactions of different orders.
result Dropout regularizes against high-order interactions by effectively canceling out the probability of surviving interactions of different orders.

Understanding how features interact with each other is of paramount importance in many scientific discoveries and contemporary applications. Yet interaction identification becomes challenging even for a moderate number of covariates. In this paper, we suggest an efficient and flexible procedure, called the interaction …

2016-05-28abs ↗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 ↗

SocialInteractionGAN generates realistic human interactions from low-dimensional data.

problem Generating realistic human interactions from limited data.
method Adversarial architecture with a recurrent encoder-decoder generator and dual-stream discriminator.
result SocialInteractionGAN produces high-quality action sequences of interacting people.

A new method detects interactions in machine learning models.

problem Interpreting non-linear and interaction effects in machine learning models.
method Regional effect plots with implicit interaction detection.
result The method quantifies and interprets feature effects reliably, less confounded by interactions.

xDeepInt learns both vector-wise and bit-wise feature interactions.

problem Learning feature interactions for CTR prediction and recommendation.
method Polynomial Interaction Network (PIN) architecture with subspace-crossing mechanism.
result xDeepInt outperforms state-of-the-art models in CTR prediction and recommendation.

This study explores how feature graphs enhance GNNs' performance in modeling interactions.

problem Improving GNNs' ability to model feature interactions effectively.
method Investigates feature graphs and their importance in GNNs, using experiments and theoretical support.
result Edges between interacting features are crucial for GNNs, while non-interaction edges can degrade performance.