TS-NMF improves topic models by incorporating user-provided labels.
problem Lack of interpretability in unsupervised topic models.
method Semi-supervised non-negative matrix factorization (TS-NMF) with user-provided labeled examples.
result TS-NMF achieves higher Jaccard similarity scores than unsupervised methods at low supervision rates.
PLRM synthesizes labels from mismatched sources for better training sets.
problem Creating labeled training sets is a major challenge in machine learning.
method PLRM uses probabilistic modeling to synthesize labels from indirect supervision sources with different output spaces.
result PLRM outperforms baselines by 2%-9% on various tasks.
The paper explores using set-level ratings for better user-item preference prediction in recommender systems.
problem Capturing user preferences on individual items using set-level ratings.
method Developed collaborative filtering-based methods to model user behaviors in set-level ratings.
result Collaborative filtering-based models can recover and predict user preferences on individual items using set-level ratings.
Proposes a method to improve hierarchical clustering using set-level structural priors.
problem Lack of supervision for non-leaf structure in hierarchical clustering.
method Introduces set-level structural priors for semi-supervised hyperbolic hierarchical clustering.
result Improves label consistency and similarity-based tree quality over baselines.
Optimizes clustering from noisy binary feedback in crowdsourcing.
problem Clustering items from binary user feedback with noisy answers.
method Develops algorithms for clustering items using adaptive selection of questions and items.
result Adaptive algorithm achieves performance close to information-theoretical limits.
FDive helps analysts create relevant patterns in high-dimensional datasets.
problem Difficult detection of relevant patterns in large, high-dimensional datasets.
method FDive uses a visual active learning system with pattern-based similarity measures to rank and classify data.
result FDive enhances the quality and understanding of relevance models, leading to new insights.
GSR optimizes tasks in scientific workflows, improving performance across diverse applications.
problem Uncertainty in task selection and evaluation in scientific workflow optimization.
method Generate-Select-Refine (GSR) framework that alternates between task generation and optimization.
result GSR outperforms existing LLM-based optimizers in various scientific applications.
We address the problem of communicating domain knowledge from a user to the designer of a clustering algorithm. We propose a protocol in which the user provides a clustering of a relatively small random sample of a data set. The algorithm designer then uses that sample to come up with a data representation under which …
In recent years rank aggregation has received significant attention from the machine learning community. The goal of such a problem is to combine the (partially revealed) preferences over objects of a large population into a single, relatively consistent ordering of those objects. However, in many cases, we might not w…
A framework for faster, better infographic design by non-experts and experts alike.
problem Designing infographics is time-consuming and tedious for non-experts and even professionals.
method Semi-automated infographic framework for structured and flow-based designs, including automatic design ranking and customization options.
result Designers from all expertise levels can generate generic infographic designs faster than existing methods while maintaining quality.
This article introduces both a new algorithm for reconstructing epsilon-machines from data, as well as the decisional states. These are defined as the internal states of a system that lead to the same decision, based on a user-provided utility or pay-off function. The utility function encodes some a priori knowledge ex…
In this paper we consider the collaborative ranking setting: a pool of users each provides a small number of pairwise preferences between d possible items; from these we need to predict preferences of the users for items they have not yet seen. We do so by fitting a rank r score matrix to the pairwise data, and pro…
New algorithms protect user-level privacy in learning tasks.
problem Protecting user-level privacy in learning tasks with stringent constraints.
method Proposes algorithms for learning tasks under user-level differential privacy constraints.
result Privacy cost decreases as users provide more samples or as the number of users increases.
A method to prevent overfitting by modeling user knowledge in interactive machine learning.
problem Overfitting due to user reinforcement of noisy patterns in training data.
method User modelling based on rational behavior to correct overfitting.
result Improves predictive performance in sentiment analysis tasks.
A new noise model for preferential Bayesian optimization using user anchors.
problem Inadequate assumption of homoscedastic noise in human-in-the-loop settings.
method Proposes a heteroscedastic noise model with anchors and a KDE uncertainty map.
result Risk-adjusted performance improvement and clarified anchor placement effects.
ICR speeds up GP modeling on unevenly spaced data.
problem High computational complexity of exact GP inference.
method Iterative Charted Refinement (ICR) for sparse, nearly arbitrary data.
result ICR achieves comparable accuracy to state-of-the-art methods but at a much faster computational speed.
Condensa programmatically optimizes neural network compression.
problem Finding optimal compression strategies for neural networks.
method Bayesian optimization-based algorithm for automatic sparsity inference.
result Significant memory and runtime improvements for real-world DNNs.
New framework shows algorithmic recourse can be harmful.
problem Risks of providing algorithmic recourse in binary classification.
method Abstract learning-theoretic framework comparing risks with and without recourse.
result Providing recourse can be harmful, increasing class uncertainty and mistakes.
Proposes a method for ranking items across multiple aspects based on user feedback.
problem No principled solution exists for generating multiple item rankings over different aspects.
method Developed a directional multi-aspect ranking criterion using probabilistic multivariate tensor factorization.
result Demonstrated effectiveness of the proposed method through comprehensive experiments on real datasets.
Study differential privacy in contextual linear bandits.
problem Maximizing rewards in a contextual bandit problem with private data.
method Adopted joint differential privacy, converted classic linear-UCB to joint-differentially private algorithm.
result First lower bound on additional regret for private algorithms.
We propose a decomposition technique to reduce user cognitive load in constructive preference elicitation.
problem Learning user preferences in large combinatorial decision problems.
method Part-wise inference and feedback over partial configurations.
result Significantly reduced user cognitive load and up to exponentially less computational demand.
Algorithm minimizes regret in multi-criteria bandits with constraints.
problem Optimize primary attribute while respecting secondary constraints.
method Con-LCB algorithm that guarantees logarithmic regret and feasibility identification.
result Logarithmic regret and feasibility identification with high probability.
Predicts gender and age from mobile phone data for marketing.
problem Enhance marketing offers by predicting customer demographics.
method Machine learning algorithms applied to CDRs, CRM, and billing info.
result 85.6% accuracy in gender prediction, 65.5% in age prediction.
Paper proposes SSSE, an efficient method to erase samples from trained models.
problem Users need control over their data used in machine learning models.
method Second-order analysis of loss landscape to derive efficient update step.
result SSSE can erase samples almost as well as training a new model from scratch.
Mechanisms for fair resource allocation learn user preferences online.
problem Fair resource allocation among users with unknown requirements.
method Repeated allocation rounds with user feedback for learning preferences.
result Mechanisms achieve efficiency, fairness, and strategy-proofness.
LLMs struggle with zero-shot annotation tasks due to model-internalized priors.
problem Impact of model-internalized priors on LLM performance in zero-shot annotation tasks.
method Investigated three dimensions: familiarity, decision stickiness, and susceptibility to misaligned task definitions.
result Nearly two-thirds of zero-shot errors are resistant to correction, with a rescue rate of 34.8%. Definition-Specific Familiarity (DSF) shows a positive association with model performance.
A new deep learning framework improves HAR with user adaptation.
problem Sensor-based human activity recognition with long-term dependencies.
method Attention-based deep learning framework with user adaptation.
result Average increment of more than 7% on F1 score over state-of-the-art.
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.
Proposes a new model for noisy labels considering multiple labelers and adversarial attacks.
problem Real-world noisy label models with multiple labelers and adversarial attacks.
method Labeler-dependent noise model with adversarial attack vectors.
result State-of-the-art approaches for learning from noisy labels are defeated by adversarial label attacks.
Label smoothing improves model performance even with noisy labels.
problem Mitigating label noise in deep learning models.
method Examined label smoothing as a technique to cope with label noise and compared it to loss-correction methods.
result Label smoothing is competitive with loss-correction techniques under label noise and beneficial for distillation from noisy data.
Paper proposes a method to recover accurate labels from partially valid data in multi-label learning.
problem Tackles noisy supervision in multi-label learning with partially valid labels.
method Develops a two-stage method that estimates label enrichment and ground-truth confidences.
result Demonstrates improved performance over state-of-the-art PML methods.
CbMLC improves multi-label classification with noisy labels.
problem Evaluating multi-label classifiers with noisy labels.
method Context-Based Multi-Label Classifier (CbMLC) that handles noisy labels without additional supervision.
result CbMLC yields substantial improvements over previous methods in noisy label settings.
LNEMLC embeds label network for multi-label classification.
problem Lack of effective adaptation and preservation of generalization abilities for unseen label combinations.
method LNEMLC embeds label network to extend input space for any base multi-label classifier.
result Statistically significant improvements over simple kNN baseline classifier.
Proposes ML-GCN for multi-label network node representation learning.
problem Complex multi-label networks with correlated labels.
method Two Siamese GCNs model node-label and label-label interactions, integrated under a unified objective function.
result Effective node representation learning with preserved label interactions.
Proposes MGPLL for PL learning with non-random noise.
problem Partial label learning with non-random label noise.
method Bi-directional mapping framework, conditional noise label generation, multi-class predictor, adversarial learning.
result Demonstrates state-of-the-art performance in partial label learning.
Logistic regression can handle noisy labels effectively when labels are imperfectly assigned by multiple experts.
problem Label noise in supervised classification due to manual labelling by multiple experts.
method Using approximate posterior probabilities of class membership from multiple experts to train logistic regression models.
result Logistic regression can be robust to label noise when classification difficulty is the only source of errors.
A new method learns label correlations for better multi-label predictions.
problem Label correlations not accurately characterized by existing approaches.
method Sparse reconstruction in the label space to learn correlations, then integrate into model training.
result Our approach outperforms state-of-the-art multi-label learning methods.
Paper tackles multi-label zero-shot learning, improving label embedding projection for unseen classes.
problem Challenges in transferring knowledge from seen to unseen classes in multi-label zero-shot learning.
method Proposes a transfer-aware embedding projection approach to project label embeddings into a low-dimensional space for better inter-label relationships and explicit information transfer.
result Demonstrates the efficacy of the proposed approach through experiments on zero-shot multi-label image classification.
FLAME auto-labels mobile data efficiently on diverse processors.
problem Accurately and efficiently labeling mobile data with unknown labels on heterogeneous processors.
method Self-adaptive auto-labeling system Flame that schedules and executes workloads on mobile processors.
result Flame achieves high labeling accuracy and performance on heterogeneous mobile processors.
PML-LFC improves PML by estimating label confidence from both feature and label spaces.
problem PML challenges in real-world scenarios where only some labels are relevant.
method PML-LFC estimates label confidence using feature and label space similarities, training a predictor with these values.
result PML-LFC achieves superior performance on synthetic and real-world datasets.
Proposes methods to improve multi-label learning by addressing local label imbalance.
problem Local label imbalance within minority class examples degrades multi-label learning performance.
method Introduces a measure to assess local label imbalance and two sampling approaches (MLSOL, MLUL) to address it.
result Experimental results show MLSOL and MLUL improve performance on multi-label datasets.
An active learner is given a hypothesis class, a large set of unlabeled examples and the ability to interactively query labels to an oracle of a subset of these examples; the goal of the learner is to learn a hypothesis in the class that fits the data well by making as few label queries as possible. This work addresses…
LaMP neural networks model label interactions for multi-label classification.
problem Efficiently modeling label interactions in multi-label classification.
method Label Message Passing (LaMP) Neural Networks, treating labels as nodes on a graph, compute hidden representations conditioned on input using attention-based message passing.
result Significantly outperforms state-of-the-art multi-label classification models on seven real-world datasets.
Paper tackles label insufficiency and inaccuracy in semi-supervised learning.
problem Label insufficiency and inaccuracy in semi-supervised learning.
method Graph-based propagation for label insufficiency and label filtering for inaccuracy.
result SIIS improves performance in the presence of label noise and scarcity.
An important problem in multi-label classification is to capture label patterns or underlying structures that have an impact on such patterns. This paper addresses one such problem, namely how to exploit hierarchical structures over labels. We present a novel method to learn vector representations of a label space give…
PrML exploits label relationships using privileged information and low-rank constraints.
problem Improving multi-label learning performance by leveraging implicit and explicit label connections.
method Generates privileged label features and integrates them into low-rank based multi-label learning framework.
result PrML significantly improves multi-label learning performance compared to competing methods.
New algorithm for XMC from aggregated labels.
problem Finding relevant labels for inputs from a large label universe.
method Developed a scalable algorithm to impute individual labels from group labels.
result Advantages over existing approaches in XMC and MIML tasks.
Enhances labels from unlabeled data using sample correlations.
problem Lack of label distributions in real-world applications.
method Proposes LESC and gLESC methods to enhance label distributions.
result Improves performance of label enhancement through sample correlations.