Generative adversarial networks improve radiation therapy planning.
problem Creating optimal radiation therapy plans.
method Using a GAN to predict 3D dose distributions directly.
result Significantly outperforms previous methods in clinical satisfaction and metrics.
Study on electronic banking satisfaction in Nigeria.
problem Limited research on factors enhancing end users' satisfaction in electronic banking.
method Empirical analysis of factors influencing electronic banking user satisfaction.
result Factors influencing electronic banking user satisfaction and their relationship with satisfaction.
Enforcing safety is a key aspect of many problems pertaining to sequential decision making under uncertainty, which require the decisions made at every step to be both informative of the optimal decision and also safe. For example, we value both efficacy and comfort in medical therapy, and efficiency and safety in robo…
The paper improves dialogue quality estimation using a novel user satisfaction model.
problem Improving dialogue quality estimation in spoken dialogue systems.
method Proposes a novel user satisfaction estimator based on BiLSTMs and reinforcement learning.
result The novel user satisfaction estimator outperforms previous models in terms of user satisfaction and task success.
DSPN predicts advertiser satisfaction and intent for e-commerce platforms.
problem Understanding advertiser intent and satisfaction for e-commerce platforms.
method Two-stage Deep Satisfaction Prediction Network (DSPN) that models intent and satisfaction.
result DSPN outperforms state-of-the-art baselines and predicts advertiser satisfaction accurately.
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.
Hybrid approach combines user feedback and machine learning for predicting user satisfaction.
problem Measuring user satisfaction in large-scale conversational agent systems.
method Fusion of explicit user feedback and predictions from two machine-learned models trained on different data types.
result Hybrid approach significantly improves user satisfaction predictions.
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.
In this paper we consider an interval portfolio selection problem with uncertain returns and introduce an inclusive concept of satisfaction index for interval inequality relation. Based on the satisfaction index, we propose an approach to reduce the interval programming problem with uncertain objective and constraints …
New algorithm improves solving constraint satisfaction problems by avoiding contradictory estimates.
problem Improving solving efficiency for constraint satisfaction problems with approximate marginals.
method Introducing a streamlined branching strategy based on streamlining constraints.
result Streamlined solvers outperform decimation-based solvers on random k-SAT instances, reducing the gap in performance by 16.3% on average.
Study shows non-systematic bias in customer satisfaction surveys limits data value.
problem Non-systematic bias in customer satisfaction surveys limits data value.
method Used real customer satisfaction survey data of a large retail bank to show the irreducible error and suggest thoughtful survey design methods.
result A thoughtful survey design can reduce non-systematic error in customer satisfaction surveys.
Enhanced neural network framework improves constraint satisfaction with topological conditioning.
problem Maintaining semantic coherence while satisfying physical and logical constraints in neuro-symbolic reasoning.
method Integrates topological conditioning with gradient stabilization mechanisms using Forman-Ricci curvature, Deep Delta Learning, and Covariance Matrix Adaptation Evolution Strategy.
result Achieves mean energy reduction to 1.15 compared to baseline values of 11.68, with 95 percent success rate.
Study reduces dataset size by 3 attributes to 73% classification accuracy.
problem Reducing dataset size for gender classification in TSI Life Satisfaction Survey.
method Attribute selection using Chi2 algorithm, followed by classification tests with Naive Bayes and Random Forest.
result Best classification rate achieved with 3 attributes selected by Chi2 algorithm.
A new online learning problem, CAB, tackles matching platforms to maximize user satisfaction.
problem Maximizing matches in a matching platform can lead to dissatisfaction and churn.
method Developed CAB, an online learning problem that maximizes arm satisfaction, and analyzed algorithms like UCB and Thompson sampling.
result CAB-UCB achieves higher cumulative satisfaction than baselines in experiments.
Analyzes retail trends from sales, search, and reviews.
problem Optimizing inventory and marketing for better customer satisfaction.
method Historical sales data, search trends, and customer reviews.
result Identifies patterns and trending products for retailers.
Researchers study how teachers' advising relationships influence their perceptions of satisfaction and students, not policy influence.
problem Understanding the relationship between teachers' advising relationships and their perceptions of satisfaction and students.
method Proposed a novel joint model of network and item responses (JNIRM) with correlated latent variables.
result Teachers' advising relationships contribute more to satisfaction and students than to influence over educational policies.
We extend the classical risk minimization model with scalar risk measures to the general case of set-valued risk measures. The problem we obtain is a set-valued optimization model and we propose a goal programming-based approach with satisfaction function to obtain a solution which represents the best compromise betwee…
Paper presents a reinforcement learning framework for personalized music playlist generation.
problem Misalignment between offline model objectives and online user satisfaction metrics in conventional playlist recommendation methods.
method Simulation-based reinforcement learning approach using a Deep Q-Network (DQN) modified to address large state and action spaces.
result The modified DQN (AH-DQN) policy leads to better user-satisfaction metrics compared to baseline methods during online A/B tests.
Despite the growing importance of multilingual aspect of web search, no appropriate offline metrics to evaluate its quality are proposed so far. At the same time, personal language preferences can be regarded as intents of a query. This approach translates the multilingual search problem into a particular task of searc…
Study examines how different types of advertising impact brand attitudes.
problem Understanding how advertising types affect brand perceptions.
method Analysis of 575 brands over five years, using national, local, and digital ads, with brand/quarter and industry/week fixed effects.
result Different types of advertising have varying impacts on brand perceptions.
GACEM optimizes complex multi-modal problems using neural networks.
problem Black-box optimization and constraint satisfaction in multi-modal environments.
method Modified Cross-Entropy Method with masked auto-regressive neural network.
result GACEM outperforms traditional CEM in diverse solutions, mode discovery, and sample efficiency.
Combines deep learning and logic constraints for visual generation.
problem Generating images with specific properties using deep learning and logic constraints.
method Formulates visual generation as a constrained satisfaction problem, using deep architectures to model variables and t-norm theory for logic variables.
result Promising results in generating handwritten characters and face transformations.
A new ML method teaches constraints directly to models.
problem Addressing safety and fairness in AI systems.
method Directly teaching constraint satisfaction to ML models using a constraint solver.
result Empirically, our approach performs well on fairness and synthetic constraints.
PDP framework learns CSP solvers without explicit search strategy.
problem Learning effective search strategies for CSP solvers.
method Proposes a generic neural framework based on propagation, decimation, and prediction.
result Demonstrates effectiveness in SAT solving compared to neural and state-of-the-art baselines.
This paper proposes a method to safely adjust exploration in RL to satisfy constraints.
problem Unsafe exploration in reinforcement learning violates constraints on controlled object states.
method Automatic adjustment of exploration inputs and variance-covariance matrix for safety.
result The method guarantees satisfaction of joint chance constraints with specified probability.
Safe control of systems with unknown dynamics using persistent excitation.
problem Tension between safety and exploration in data-driven control.
method System identification through persistent excitation, robust constraint satisfaction, and synthesis of feedback controllers.
result Non-asymptotic guarantees on estimation and controller performance.
Paper uses RL to synthesize control policies for LTL objectives in uncertain environments.
problem Control policies for uncertain, probabilistic environments with temporal logic specifications.
method Model-free RL algorithm, LTL to LDBA translation, synchronous reward function, asymptotic satisfaction probability.
result RL algorithm maximizes satisfaction probability of LTL objectives in PL-MDPs.
Improves generative models by optimizing rewards and sample editing.
problem Efficiently generating high-reward samples with structural constraints.
method Introduces MDM-VGB, a discrete diffusion sampler that augments unmasking generation with reward-guided remasking.
result MDM-VGB achieves quadratic complexity and robustness to noise, outperforming heuristics like best-of- N N N . The paper shows regularization can't always find all optimal solutions in constrained ML.
problem Finding the right balance between model accuracy and constraint satisfaction.
method Formal demonstration of the limitations of regularization-based approaches in non-convex cases.
result There are optimal solutions for constrained problems that do not correspond to any multiplier value.
TIP-Search optimizes market prediction accuracy and timeliness under uncertain load.
problem Real-time market prediction requires accurate predictions before a deadline.
method Filters feasible models, dispatches workers, trades accuracy for deadline risk.
result Optimized pool achieves 0.991 timely accuracy and 0.994 raw accuracy.
LIMEADE improves AI advice for opaque models, enhancing accuracy and user satisfaction.
problem Lack of advice methods for opaque AI models.
method Develops a general framework to translate advice into model updates.
result Improves accuracy and user satisfaction compared to baselines.
This paper presents a new approach for training artificial neural networks using techniques for solving the constraint satisfaction problem (CSP). The quotient gradient system (QGS) is a trajectory-based method for solving the CSP. This study converts the training set of a neural network into a CSP and uses the QGS to …
SAVED safely learns robot tasks with sparse rewards.
problem Challenges in reinforcement learning for robotics, especially sparse rewards and complex constraints.
method SAVED uses supervision to constrain exploration and learn efficiently, handling complex constraints.
result SAVED outperforms state-of-the-art methods in success rate, constraint satisfaction, and sample efficiency.
CRPO solves challenging SRL problems with convergence guarantee.
problem Safe reinforcement learning with nonconvex constraints.
method Primal approach using alternating policy updates and NPG.
result Achieves O ( 1 / T ) \mathcal{O}(1/\sqrt{T}) O ( 1/ T ) convergence rate and error bound. New algorithm optimizes long-term user satisfaction in recommendation systems.
problem Optimizing long-term user satisfaction in recommendation systems with delayed rewards.
method Developed a predictive model of delayed rewards and a bandit algorithm that balances exploration and exploitation.
result Our approach results in substantially better performance compared to short-term or delayed optimization.
Safe reinforcement learning for continuous control using Lyapunov methods.
problem Ensuring safe interactions in continuous action reinforcement learning.
method Formulates CMDPs, uses Lyapunov-based projection for policy updates, integrates with PG methods.
result Demonstrates effectiveness in balancing performance and constraint satisfaction.
The paper predicts diseases using both clinical and genomics data.
problem Clinical predictions using genomics data are not common.
method Integrated clinical and genomics datasets, machine learning, Principal Component Analysis for feature selection.
result 73% accuracy in predicting 75 disease classes.
New algorithm optimizes for long-term user satisfaction in delayed reward settings.
problem Optimizing for long-term user satisfaction in delayed reward settings.
method Developed a predictive model of delayed rewards and a bandit algorithm that combines rewards and surrogate outcomes.
result Our algorithm significantly outperforms methods that optimize for short-term proxies or rely solely on delayed rewards.
Improved model predicts ICU readmission and mortality with interpretable results.
problem Lack of clinically interpretable predictions from deep learning models on clinical notes.
method Augmented a convolutional model with an attention mechanism for clinical note prediction.
result Attention mechanism improves prediction performance while providing interpretable results.
SparseVM registers clinical 3D scans faster and more accurately.
problem Inaccurate and slow registration of sparse clinical 3D scans.
method Learning-based registration method tailored for clinical sparse MRI.
result Orders of magnitude faster and more accurate than existing methods.
New algorithm reduces robust optimization scale for better constraint satisfaction.
problem Finding robust solutions to optimization problems with unknown constraints.
method Empirical domain reduction to determine robustness scale.
result Our algorithm's scale is less affected by parameter dimensionality.
Clinical AI models fail to transfer between sites due to site-specific practices.
problem Clinical AI models perform poorly at new sites.
method Identify and isolate site-specific clinical practices affecting data distribution.
result A potential solution to improve model transferability.
Convolutional attractor nets improve image completion and super-resolution.
problem Construct coherent neural states from noisy data.
method Revisit and extend attractor networks with convolutional bipartite architecture.
result Demonstrates potential for image completion and super-resolution.
Dynamical systems with large state-spaces are often expensive to thoroughly explore experimentally. Coarse-graining methods aim to define simpler systems which are more amenable to analysis and exploration; most current methods, however, focus on a priori state aggregation based on similarities in transition rates, whi…
Model learns hierarchical EHR representation for clinical outcome prediction.
problem Capturing temporal patterns in irregular clinical event sequences.
method Proposes differentiated mechanisms to model events at different time scales, learning hierarchical representations.
result Significantly improves clinical outcome prediction, achieving AUC scores of 0.94 and 0.90 for death and ICU admission respectively.
Scalable model checking for stochastic systems using Gaussian Processes and Bayesian Neural Networks.
problem Efficiently verifying properties of stochastic systems with high-dimensional parameter spaces.
method Stochastic Variational Smoothed Model Checking (SV-smMC) using Gaussian Processes and Bayesian Neural Networks.
result SV-smMC scales to larger datasets and enables application to high-dimensional parameter spaces.
System suggests clinical concepts in real-time for faster note creation.
problem Efficiently creating structured clinical notes with minimal keystrokes.
method Contextual autocompletion using shallow neural networks.
result Reduces keystrokes by 67% in real hospital environments.
Machine learning aids in clinical prediction tasks.
problem Improving accuracy in clinical predictions.
method Introduction to machine learning concepts and algorithms, followed by practical application to clinical datasets.
result Demonstrated the application of machine learning models to clinical prediction problems.