Novel method decomposes EDA signals to reveal user responses.
problem Superposition of noise components obscures EDA signal information.
method Simple pre-processing followed by compressed sensing decomposition.
result Provably accurate recovery of user responses with reduced noise.
Neural pedagogical agent updates user models in real-time for mobile education apps.
problem Real-time user modeling for dynamic mobile education platforms.
method Bidirectional recurrent neural networks with attention mechanism over embedded question-response pairs.
result Model outperforms existing approaches in predicting user response correctness.
RNNs improve predictive precompute for faster user interface response times.
problem Improving user interface response times in mobile and web applications.
method Application of recurrent neural networks (RNNs) for predictive precompute.
result RNN models improve prediction accuracy and reduce computational cost.
Paper proposes PNN and PIN models for better user response prediction.
problem User response prediction in multi-field categorical data with sparse representations.
method Kernel product for field-aware feature interactions, Product-based Neural Network (PNN) for DNN-based models, and Product-network In Network (PIN) for generalization.
result PNN and PIN models consistently outperform 8 baselines on AUC and log loss.
New metric estimates user satisfaction for dialogue quality evaluation.
problem Sparse and intrusive explicit user feedback for dialogue quality evaluation.
method Created a new Response Quality annotation scheme and developed a turn-level User Satisfaction metric using five domain-independent feature sets and six machine learning models.
result Gradient boosting regression achieved best correlation of ~0.79 between predicted and annotated user satisfaction labels.
Previous work on recommender systems mainly focus on fitting the ratings provided by users. However, the response patterns, i.e., some items are rated while others not, are generally ignored. We argue that failing to observe such response patterns can lead to biased parameter estimation and sub-optimal model performanc…
Machine learning detects survey validity from user behavior.
problem Detecting valid responses in web surveys.
method Uses mouse activity and machine learning models (LSTM, HMM).
result Predicts survey validity without analyzing specific answers.
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.
RecSim creates customizable simulation environments for RSs.
problem Creating realistic simulation environments for RSs.
method Configurable platform for authoring simulation environments.
result Enables pushing the limits of RL and RS techniques.
Automated dialogue quality evaluation using user satisfaction estimates across multiple domains.
problem Lack of automated and domain-independent dialogue quality evaluation metrics.
method Created a new Response Quality annotation scheme, introduced five domain-independent feature sets, and experimented with six machine learning models.
result Gradient Boosting Regression model achieved best prediction performance, with a 16% relative improvement in binary satisfaction class prediction accuracy.
AI assistants often give convincing but incorrect responses to match user beliefs.
problem Sycophancy in AI assistants that use human feedback.
method Examined five AI assistants across four tasks, analyzed human preference data, and compared model outputs against preference models.
result Sycophancy is a general behavior of AI assistants, driven in part by human preference judgments.
ONN learns different representations for different operations to improve user response prediction.
problem Improving user response prediction in online advertising and recommendation systems.
method Proposes Operation-aware Neural Networks (ONN) to learn different representations for different operations.
result ONN consistently outperforms state-of-the-art models in both offline and online environments.
Bayesian optimization agent learns user preferences from pairwise comparisons.
problem Learning user preferences from unknown and infinite choices.
method Sequential Bayesian optimization with pairwise comparisons.
result Optimal agent strategy minimizes remaining system uncertainty.
Model learns metrics and preferences from user comparisons.
problem Simultaneous metric and preference learning from user comparisons.
method Jointly learns a metric and latent ideal points for each user.
result Model captures individual preferences and learns metrics efficiently.
IntelligentPooling improves treatment decisions in mHealth.
problem Optimizing treatment decisions in mobile health with limited data and non-stationary responses.
method Generalized Thompson-Sampling bandit algorithms to IntelligentPooling, addressing differential response, limited data, and non-stationary responses.
result IntelligentPooling achieves 26% lower regret compared to state-of-the-art methods.
A new Input-Output model, called the Multi-Entity Input-Output (MEIO) model, is introduced to estimate the responsibility of entities of an ecosystem on the footprint of each other. It assumed that the ecosystem is comprised of end users, service providers, and utilities. The proposed MEIO modeling approach can be seen…
Response time improves alignment with diverse human preferences.
problem Standard aggregation of feedback ignores heterogeneity and anonymity.
method Augmenting feedback with response time data and modeling decisions with DDM.
result Estimator of heterogeneous preferences converges to true average preference.
A new algorithm estimates item parameters in item response theory models.
problem Estimating item parameters in item response theory models.
method Computation of the stationary distribution of a Markov chain defined on an item-item graph.
result Our algorithm is consistent and enjoys favorable optimality properties.
Estimates user preferences from noisy paired comparisons.
problem Estimating user preferences from noisy paired comparisons.
method Greedy information maximization strategies.
result Superior preference estimation over state-of-the-art methods.
New methods protect privacy while providing accurate prediction sets.
problem Privacy-preserving conformal prediction for untrusted aggregators.
method Two LDP approaches: k-ary randomized response and binary search response.
result Finite-sample coverage guarantees and robust coverage under randomization.
FPP creates interpretable 2D embeddings for high-dimensional data.
problem Discovering interpretable relationships in high-dimensional data.
method Function preserving projections (FPP) for scalable linear embeddings.
result FPP reveals non-linear patterns of user-selected response functions.
Paper explores privacy-preserving methods for estimating user data distributions.
problem Protecting user privacy while analyzing categorical data.
method Introduces new mechanisms like hashed K-ary Randomized Response (KRR) for discrete distribution estimation.
result New mechanisms meet or exceed existing methods in utility at all privacy levels.
Adaptive querying learns user psychometrics with AI personas.
problem Learning user psychometrics within query budgets.
method Persona-induced latent variable model with AI personas and large language model response distributions.
result Persona-based posteriors deliver accurate probabilistic predictions.
This study improves user segmentation for online news recommendation systems.
problem Challenges in building modern recommender systems due to dynamic environments and data sparsity.
method Trend-responsive unsupervised user segmentation using multi-armed bandits.
result Significant improvements in online A/B tests compared to global-optimization algorithms.
Robot learns user preferences from brain signals.
problem Decoding user preferences for robot motions from brain signals.
method Proposes a novel approach using electroencephalography to decode user preferences from brain signals.
result Brain signals can reliably infer user preferences for robot trajectories.
The paper analyzes transaction fees on blockchains using a priority queue model.
problem Understanding and optimizing transaction fees on blockchain networks.
method An M/G^K/1 priority queue model is used to analyze transaction fees and user behavior.
result New insights into the dynamics of transaction fees and their impact on user behavior are provided.
Study optimizes classifiers for credit card mail campaigns and default prediction.
problem Optimizing classifiers for credit card mail campaigns and default prediction.
method Three distinct models: response, risk, and response-risk. Optimized various performance metrics.
result Random Forest classifier achieves highest accuracy (83.2%) in multi-class response-risk model.
Self-feeding chatbots learn from user feedback to improve performance.
problem Lack of training data after deployment of dialogue agents.
method Extracts new training examples from user responses and uses feedback to improve dialogue abilities.
result Self-feeding chatbots significantly improve performance on PersonaChat dataset.
CausalRM models rewards from user feedback, overcoming noise and bias.
problem Aligning language models with user preferences from noisy, biased feedback.
method Causal-theoretic reward modeling framework addressing noise and bias in observational feedback.
result CausalRM learns accurate reward signals from noisy and biased observational feedback.
A new algorithm for social network recommendations using side-observations.
problem Designing recommendation algorithms for users influenced by their social network.
method Contextual bandits with side-observations modeled by a social network graph.
result The proposed algorithm achieves asymptotically optimal regret, matching the lower-bound as To∞. Proposes HMHP for joint modeling of user-topic interactions.
problem Complex interactions between users, topics and time on social media.
method Hidden Markov Hawkes Process (HMHP) incorporating topical Markov Chains.
result HMHP outperforms state-of-the-art models in generalization and accuracy.
Improves learning efficiency for active sequential learners.
problem Optimizing training data for sequential learners who actively choose their queries.
method Formulated as a Markov decision process, addressing both teaching and learning from a teacher.
result Planning teaching and learner's model of the teacher improve learning outcomes.
User contributions in the form of posts, comments, and votes are essential to the success of online communities. However, allowing user participation also invites undesirable behavior such as trolling. In this paper, we characterize antisocial behavior in three large online discussion communities by analyzing users who…
Paper introduces SDM for detecting LLM hallucinations, improving on entropy tests.
problem Challenges of Large Language Models (LLMs) with non-factual, nonsensical responses.
method Joint clustering on sentence embeddings to measure semantic divergence between prompts and responses.
result SDM framework detects deeper form of arbitrariness in LLM responses.
The paper develops models to influence user interests in recommendation systems.
problem Recommendation systems assume rigid user interests, ignoring the effect of learning strategies.
method Develops influence models for a learning algorithm that optimally recommends websites.
result The models show how learning strategies can influence steady user interests and optimal strategies.
A system for attributing ad effects using a neural network and Shapley values.
problem Attributing ad effects to individual ads in a complex, sequential environment.
method A two-step approach: response modeling with RNN and credit allocation with Shapley values.
result The system accurately allocates incremental ad effects to individual ads, handling sequence dependence.
HCPF improves recommendation systems by decoupling sparsity and response models.
problem Collaborative filtering with extreme sparsity and complex response types.
method Introduces HCPF with a Gamma-Poisson structure, decoupling sparsity and response models.
result HCPF outperforms HPF in capturing sparsity and response relationships.
New bandit model accounts for user departures in recommender systems.
problem Capturing user departures in recommender systems with multi-armed bandits.
method Proposes a novel multi-armed bandit setup with two types of users and analyzes optimal and efficient algorithms.
result Achieves optimal and efficient learning algorithms for user types and reward probabilities.
Detects rumours using news propagation patterns and user interactions.
problem Rumours' negative impact on social media platforms.
method Deep learning approach that learns user representations and temporal interactions.
result State-of-the-art performance in rumour detection on Twitter and Weibo datasets.
Deep factorization machines improved SLAM task performance.
problem Improving second language acquisition modeling.
method Used deep factorization machines to model pairwise relationships.
result Achieved AUC 0.815, beating logistic regression baseline.
Locally private online quantile regression method addresses privacy constraints.
problem Estimating and inferring quantile regression under local differential privacy constraints.
method Developed a finite-alphabet channel where users compute local contributions, apply randomized response, and send reports. A public decoder corrects distortion and reconstructs inputs for averaging.
result Established local privacy, decoder unbiasedness, consistency, asymptotic normality, and inference for scalar contrasts.
Paper fine-tunes LLMs using user edits, unifying preference, supervision, and reward feedback.
problem Adapting LLMs to user preferences and feedback types.
method Derives bounds for learning algorithms from user edits, proposes an ensembling procedure.
result Ensembling procedure outperforms individual feedback methods and robustly adapts to different user-edit distributions.
The paper enhances preference learning by incorporating response time data.
problem Lack of temporal information in user decision-making for reward model learning.
method Integrates response time alongside binary choice data using the EZ model and Neyman-orthogonal loss functions.
result Response time-augmented approach reduces error rates from exponential to polynomial scaling, improving sample efficiency.
Active learning suffers from biased non-response, which this paper addresses.
problem Active learning's effectiveness is compromised by biased non-response in real-world contexts.
method Proposes a cost-based correction to the sampling strategy, UCB-EU, to mitigate the impact of biased non-response.
result UCB-EU successfully reduces the harm from labelling non-response in many settings.
BART is extended to handle various response variables.
problem Modeling nonlinear regression functions for diverse response types.
method Generalized Bayesian Additive Regression Trees (GBART) for exponential family distributions.
result The posterior concentrates at a minimax rate for certain response distributions.
The paper provides concentration bounds for embeddings of generative models.
problem Establishing accurate statistical analysis of generative models.
method Data Kernel Perspective Space embedding method.
result Required number of sample responses for accurate approximation.
Two privacy-preserving rating collection methods for recommender systems.
problem Collecting user ratings while maintaining privacy.
method Modified Laplace mechanism and randomized response.
result Both mechanisms are differentially private and preserve data utility.
FSPO optimizes synthetic preferences for LLM personalization.
problem Personalizing large language models for diverse users.
method FSPO reframes reward modeling as a meta-learning problem, using few labeled preferences and synthetic data.
result FSPO achieves high winrates in personalized responses, both synthetic and real.