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.

169,051 papers · 148 categories

Trend · papers per month

85170255340 · Jun 202019922001200920172026
48 results for label interactions

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.

DPBD simplifies labeling functions through interactive demonstrations.

problem Difficulty in writing labeling functions for large-scale labeled training data.
method Data Programming by Demonstration (DPBD) framework using interactive demonstrations.
result Ruler system generates labeling rules more easily and with higher user satisfaction.

Visual reranking is effective to improve the performance of the text-based video search. However, existing reranking algorithms can only achieve limited improvement because of the well-known semantic gap between low level visual features and high level semantic concepts. In this paper, we adopt interactive video search…

2011-03-14abs ↗pdf ↗

FLDCRF improves sequence labeling performance with latent dynamics interactions.

problem Sequence labeling with improved performance and latent dynamics interactions.
method Factored Latent-Dynamic Conditional Random Fields (FLDCRF) with multiple latent dynamics interactions.
result FLDCRF outperforms state-of-the-art models across multiple datasets.

We study the problem of interactively learning a binary classifier using noisy labeling and pairwise comparison oracles, where the comparison oracle answers which one in the given two instances is more likely to be positive. Learning from such oracles has multiple applications where obtaining direct labels is harder bu…

2017-04-19abs ↗pdf ↗

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.

Enhances LDL by integrating distance and directional information for more robust label feature representation.

problem Lack of robust label feature representation in LDL tasks, especially with label ambiguity.
method Introduces Structural Anchor Points (SAPs) to capture inter-cluster interactions and a novel LSFs construction strategy, LIFT-SAP.
result Improves LDL performance by 15% on average across 15 real-world datasets.

Interactive learning is a process in which a machine learning algorithm is provided with meaningful, well-chosen examples as opposed to randomly chosen examples typical in standard supervised learning. In this paper, we propose a new method for interactive learning from multiple noisy labels where we exploit the disagr…

2016-07-24abs ↗pdf ↗

Interactive weak supervision learns useful heuristics from user feedback.

problem Creating useful heuristics for large labeled datasets is tedious and subjective.
method Develops an interactive framework for learning heuristics from user feedback.
result Only a few feedback iterations are needed to train models without ground truth labels.

Interactive machine learning improves learning efficiency with user input.

problem Expensive, time-consuming, or risky acquisition of labeled data and decision-making.
method Develops new algorithms for active learning, sequential decision making, and model selection under partial feedback.
result First efficient algorithms achieving exponential label savings and independent of action space size.

A new model embeds word and label hierarchies in hyperbolic space for HMLC.

problem Learning mappings from word hierarchies to label hierarchies in hierarchical multi-label classification.
method Proposes a Hyperbolic Interaction Model (HyperIM) to learn label-aware document representations in hyperbolic space.
result Demonstrates improved performance for HMLC compared to state-of-the-art methods.

Develops methods for clustering hypergraphs with categorical edge labels.

problem Complex graph representations with multiple interaction types.
method Combinatorial objective function, polynomial-time algorithm for two types, linear programming relaxations for more types.
result Efficient algorithms for clustering hypergraphs with categorical edge labels.

Study efficient interactive learning for structured outputs with reliable computation.

problem Interactive learning with noisy labels and structured output spaces.
method Identify and utilize CRISPs (probabilistic models) that guarantee reliable and efficient computation of probabilistic quantities.
result CRISPs enable robust and efficient active and skeptical learning in large structured output spaces.

XLabel tool reduces medical experts' workload by 40% and explains its decisions.

problem Efficiently labeling large electronic health records.
method Visual-interactive tool using Explainable Boosting Machine (EBM) for classification and explanation.
result EBM achieves high accuracy and explainability, even with mislabeled data.

HopGAT improves node classification in sparsely labeled graphs by learning from distant neighbors.

problem Classifying nodes in sparsely labeled graphs with limited labeled data.
method Hop-aware supervision mechanism and simulated annealing learning strategy.
result The model achieves high accuracy even with 40% labeled data, reducing performance loss to 3.9%.

We introduce structured prediction energy networks (SPENs), a flexible framework for structured prediction. A deep architecture is used to define an energy function of candidate labels, and then predictions are produced by using back-propagation to iteratively optimize the energy with respect to the labels. This deep a…

2015-11-19abs ↗pdf ↗

Improved drug-protein interaction prediction using FTL method.

problem Predicting drug-protein interactions from noisy data with uncertain labels.
method Filtered Transfer Learning (FTL) method that fine-tunes a deep neural network across multiple tiers of data confidence.
result FTL method outperforms deep neural networks trained on single confidence ranges.

In this work, we introduce a novel framework that employs cluster annotation to boost active learning by reducing the number of human interactions required to train deep neural networks. Instead of annotating single samples individually, humans can also label clusters, producing a higher number of annotated samples wit…

2018-12-31abs ↗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 ↗

GENN predicts drug interactions by modeling correlations between link labels.

problem Predicting drug-drug interactions with consideration of link type correlations.
method GENN uses graph energy neural networks to model link type correlations in DDI prediction.
result GENN outperforms baseline models by 13.77% and 5.01% in PR-AUC on two real-world datasets.

We tackle the problem of inferring node labels in a partially labeled graph where each node in the graph has multiple label types and each label type has a large number of possible labels. Our primary example, and the focus of this paper, is the joint inference of label types such as hometown, current city, and employe…

2014-01-30abs ↗pdf ↗

An interactive image retrieval system learns which images in the database belong to a user's query concept, by analyzing the example images and feedback provided by the user. The challenge is to retrieve the relevant images with minimal user interaction. In this work, we propose to solve this problem by posing it as a …

2018-02-12abs ↗pdf ↗

Study learning and refutation in non-interactive LDP, showing sample complexity equivalence.

problem Characterize sample complexity for learning and refutation in non-interactive LDP.
method Characterize sample complexity for agnostic PAC learning in non-interactive LDP protocols.
result Optimal sample complexity for any concept class is captured by the approximate γ2γ_2~norm of a natural matrix associated with the class.

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 ↗

Archipelago provides interpretable explanations of feature interactions in machine learning models.

problem Interpreting the impact of feature interactions on predictions in machine learning models.
method Archipelago is a novel framework for extracting and attributing feature interactions in a scalable and interpretable manner.
result Archipelago provides significantly more interpretable explanations of feature interactions than comparable methods.

We address the problem of semi-supervised learning in relational networks, networks in which nodes are entities and links are the relationships or interactions between them. Typically this problem is confounded with the problem of graph-based semi-supervised learning (GSSL), because both problems represent the data as …

2016-12-15abs ↗pdf ↗

Interactive machine learning with weak supervision and pre-trained embeddings.

problem Training machine learning models with limited labeled data.
method Use pre-trained embeddings to define a distance function and extend source votes to nearby points.
result Significantly outperforms traditional weakly-supervised and fully-supervised methods.

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…

2015-10-09abs ↗pdf ↗

CASTER predicts drug interactions using chemical substructures.

problem Identifying potential drug-drug interactions during drug design.
method CASTER uses sequential pattern mining, auto-encoding, and dictionary learning to predict DDIs.
result CASTER outperformed state-of-the-art models and provided interpretable predictions.

Collective classification models attempt to improve classification performance by taking into account the class labels of related instances. However, they tend not to learn patterns of interactions between classes and/or make the assumption that instances of the same class link to each other (assortativity assumption).…

2012-09-25abs ↗pdf ↗

New robust algorithms improve learning with feature feedback.

problem Interactive learning with discriminative feature feedback.
method Developed new robust interactive learning algorithms with improved mistake bounds.
result Achieved significantly lower mistake bounds in adversarial and stochastic settings.

Interactive learning with hindsight instruction feedback achieves better performance than traditional methods.

problem Learning with expert supervision of optimal responses is often impractical or requires expert knowledge.
method Study of interactive learning with hindsight instruction feedback, introducing LORIL algorithm.
result LORIL algorithm achieves T\sqrt{T} regret, improving over baselines in domains with low-rank instruction-response distribution.

Semi-automatic data annotation helps experts label unlabeled samples based on feature space projection.

problem Laborious manual data annotation for machine learning.
method Interactive semi-automatic approach using feature space projection and semi-supervised learning.
result Reduces user annotation effort and improves classification accuracy.

Enhances image classification by integrating semantic hierarchy into CNN models.

problem Limited use of external guidance in image classification.
method Integrates label-hierarchy knowledge into CNN-based classifiers and uses order-preserving embeddings.
result Boosts image classification performance through semantic hierarchy integration.

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.

We study agnostic active learning, where the goal is to learn a classifier in a pre-specified hypothesis class interactively with as few label queries as possible, while making no assumptions on the true function generating the labels. The main algorithms for this problem are {\em{disagreement-based active learning}}, …

2014-07-10abs ↗pdf ↗

New method learns interpretable concepts from user feedback for high-dimensional data.

problem Lack of interpretable concepts in machine learning models trained on high-dimensional tabular data.
method Proposes a method for learning transparent concept definitions from user labeling of concept features, not instances.
result Demonstrates more efficient learning of aligned concept definitions from user feedback compared to alternative transparent approaches.

Predicts student performance in interactive online question pools using GNNs.

problem Predicting student performance in interactive online question pools with evolving knowledge.
method Proposes R^2GCN, a GNN model for heterogeneous networks to predict student performance.
result Achieves higher accuracy in student performance prediction than traditional methods.

Unified analysis of multilabel Fisher discriminants with improved dimensionality and robustness.

problem Improving discriminant analysis for multilabel classification with enhanced dimensionality and robustness.
method Unified algebraic and statistical analysis of multilabel Fisher discriminants with Stiefel orthogonality constraints.
result Equivalence of four Fisher objectives under the Stiefel constraint and improved discriminant dimensionality.

Fair active learning selects data points to balance model accuracy and fairness.

problem Ensuring fairness in machine learning models used in high-stakes applications.
method Designing algorithms for fair active learning that select data points to balance model accuracy and fairness.
result Demonstrated the effectiveness and efficiency of fair active learning algorithms over benchmark datasets.