We consider the problem of naming objects in complex, natural scenes containing widely varying object appearance and subtly different names. Informed by cognitive research, we propose an approach based on sharing context based object hypotheses between visual and lexical spaces. To this end, we present the Visual Seman…
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,742 papers · 148 categories
Trend · papers per month
48 results for “Context Labels”
A new learning scheme improves model efficiency and performance.
problem Characterizing correlation between batch-level and global data distributions.
method Epoch-evolving Gaussian Process Guided Learning (GPGL) scheme with context labels and triangle consistency loss.
result Significantly outperforms existing models on mainstream datasets.
RDLI integrates domain logic and context grounding to detect crypto anomalies under scarce labels.
problem Extreme label scarcity and evasion strategies in crypto networks.
method Relational Domain Logic Integration (RDLI) with Retrieval Grounded Context (RGC).
result RDLI outperforms GNN baselines by 28.9% in F1 score under 0.01% label scarcity.
Neural processes approximate Gaussian process inference, revealing three key costs.
problem Approximating Gaussian process inference with neural processes.
method Bounding KL divergence into three components: label contamination, information bottleneck, and amortization error.
result Characterization of three costs of amortizing Gaussian process inference with neural processes.
Transformers trained on random classification tasks generalize well and can overfit without error.
problem Understanding how transformers generalize and overfit in-context.
method Analysis of implicit regularization during gradient descent training.
result Transformers can overfit without error and still generalize well.
CAMS selects best pre-trained model for unlabeled data points.
problem Efficiently utilizing pre-trained models and unlabeled data.
method Contextual active model selection algorithm with two components: contextual model selection and active query.
result CAMS requires less than 10% labeling effort compared to existing methods, achieving similar or better accuracy.
A new algorithm tackles graph-based contextual bandits with efficient regret bounds.
problem Predicting labels on graphs with contextual bandit methods.
method Graph-based contextual bandit algorithm using optimal stochastic bandit techniques.
result Regret bounds for line graphs and trees, and improved bounds for general graphs.
In-context learning solves PU classification without iterative optimization.
problem Binary classification with only labeled positives and unlabeled samples.
method Pretrained transformer (PUICL) that learns from synthetic PU datasets.
result Outperforms four standard PU learning baselines on 20 benchmarks.
Extreme multi-label text classification (XMTC) addresses the problem of tagging each text with the most relevant labels from an extreme-scale label set. Traditional methods use bag-of-words (BOW) representations without context information as their features. The state-ot-the-art deep learning-based method, AttentionXML…
This study explores how examples influence ICL in LLMs.
problem Understanding how examples impact in-context learning in large language models.
method Theoretical study with a probabilistic model extending from Gaussian mixture model.
result The impact of pre-training knowledge and examples on ICL prediction accuracy.
Model predicts political ideology using context vectors to mitigate bias and scarcity.
problem Scarcity and selection bias in political ideology prediction.
method Proposes a statistical model decomposing embeddings into context and position vectors, training an end-to-end model for deployment.
result Model can predict ideological labels even with minimal biased data, outperforming state-of-the-art methods.
We address the problems of multi-domain and single-domain regression based on distinct and unpaired labeled training sets for each of the domains and a large unlabeled training set from all domains. We formulate these problems as a Bayesian estimation with partial knowledge of statistical relations. We propose a worst-…
LangDA improves domain adaptation for semantic segmentation by learning context-aware scene descriptions.
problem Improving domain adaptation for semantic segmentation with dense prediction tasks.
method LangDA learns contextual relationships between objects via VLM-generated scene descriptions and aligns image features with text representation.
result LangDA sets new state-of-the-art across three DASS benchmarks, outperforming existing methods.
Smart devices of everyday use (such as smartphones and wearables) are increasingly integrated with sensors that provide immense amounts of information about a person's daily life such as behavior and context. The automatic and unobtrusive sensing of behavioral context can help develop solutions for assisted living, fit…
Learning with Label Proportions (LLP) is the problem of recovering the underlying true labels given a dataset when the data is presented in the form of bags. This paradigm is particularly suitable in contexts where providing individual labels is expensive and label aggregates are more easily obtained. In the healthcare…
We introduce a novel class of labeled directed acyclic graph (LDAG) models for finite sets of discrete variables. LDAGs generalize earlier proposals for allowing local structures in the conditional probability distribution of a node, such that unrestricted label sets determine which edges can be deleted from the underl…
This article proposes a biologically inspired neurocomputational architecture which learns associations between words and referents in different contexts, considering evidence collected from the literature of Psycholinguistics and Neurolinguistics. The multi-layered architecture takes as input raw images of objects (re…
Proposes a context-aware approach to deep autoencoder novelty detection.
problem Challenges of static distribution in novelty detection.
method Semi-supervised network architecture with auxiliary labels for contextual information.
result Single model achieves performance of individually trained models on various contexts.
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.
The paper tackles partial inference in structured prediction using a convex optimization approach.
problem Maximizing a score function with unary and pairwise potentials in graph label spaces.
method Generative model approach with two-stage convex optimization for label recovery.
result Conditions for recovering a majority of labels with provable guarantees.
Rethinking Self-Distillation: Label Averaging and Enhanced Soft Label Refinement with Partial Labelscs.LG
Improved self-distillation reduces label noise and enhances model accuracy.
problem Label noise in multi-class classification.
method Label averaging and refined partial labels.
result Single-round self-distillation achieves comparable performance to multi-round distillation.
Label aggregation makes learning robust to noisy labels.
problem Learning from noisy labels.
method Label aggregation and risk consistency.
result Aggregated labels lead to stronger consistency guarantees.
This work analyzes label embedding for large multiclass classification problems.
problem Label embedding for large multiclass classification problems.
method Analysis of label embedding in extreme multiclass classification, presenting an excess risk bound and showing a trade-off between computational and statistical efficiency.
result The statistical penalty for label embedding vanishes with sufficiently low coherence under the Massart noise condition.
We explore the problem of learning under selective labels in the context of algorithm-assisted decision making. Selective labels is a pervasive selection bias problem that arises when historical decision making blinds us to the true outcome for certain instances. Examples of this are common in many applications, rangin…
TL-ANDI distills context from source data to improve transfer learning for TFMs.
problem Limited transfer learning due to context-size constraints and distribution shifts.
method TL-ANDI uses posterior-aware distillation to construct a compact source context and locally distills labels.
result Improves transfer performance by addressing context-size and distribution shifts.
Improved time series classification with imputed data using label-guided forest-based methods.
problem Missing data in time series data.
method Label-guided imputation using forest-based proximity measures.
result Imputation leads to higher classification accuracies, even with imputed values differing from true values.
ELSA efficiently adapts to label shift without post-prediction calibrations.
problem Domain adaptation with label shift across training and testing datasets.
method Moment-matching framework based on influence function geometry; solves linear systems for adaptation weights.
result ELSA estimator is -consistent and asymptotically normal, achieving state-of-the-art estimation performance.
This work is an endeavor to develop a deep learning methodology for automated anatomical labeling of a given region of interest (ROI) in brain computed tomography (CT) scans. We combine both local and global context to obtain a representation of the ROI. We then use Relation Networks (RNs) to predict the corresponding …
Proposes semi-supervised feature ranking for handling high-dimensional, unlabeled data.
problem Handling high-dimensional, unlabeled data in machine learning.
method Tree ensembles and Relief family algorithms for semi-supervised feature ranking.
result Semi-supervised feature ranking outperforms supervised methods across most datasets.
Study the averaging estimator on graphs with labeled nodes.
problem Understanding the quality of averaging estimators on graph data.
method Rigorously study concentration properties, variance bounds, and risk bounds.
result Contributes to theoretical understanding of graph learning.
Generating labeled training datasets has become a major bottleneck in Machine Learning (ML) pipelines. Active ML aims to address this issue by designing learning algorithms that automatically and adaptively select the most informative examples for labeling so that human time is not wasted labeling irrelevant, redundant…
In this paper we review the definitions of homogeneous and alternative links. We also give two new characterizations of an alternative link diagram, one within the context of the enhanced checkerboard graph and another from the labeled Seifert graph.
We study the natural map eta between a group of binary planar trees whose leaves are labeled by elements of a free abelian group H and a certain group D(H) derived from the free Lie algebra over H. Both of these groups arise in several different topological contexts. The map eta is known to be an isomorphism over Q, bu…
A new method learns from synthetic data without needing real-world examples.
problem Learning robust classifiers from limited real-world data.
method A novel setting and algorithm exploiting synthetic data independence.
result Robust classifiers trained on synthetic data generalize well to real-world domains.
Noisy labels often occur in vision datasets, especially when they are obtained from crowdsourcing or Web scraping. We propose a new regularization method, which enables learning robust classifiers in presence of noisy data. To achieve this goal, we propose a new adversarial regularization scheme based on the Wasserstei…
AP-Calculus offers a new framework for causal inference in Bayesian networks.
problem Causal inference in Bayesian networks with complex architectures.
method Introduces Attribution Projection Calculus (AP-Calculus) to determine causal relationships.
result Proves that for each label, exactly one intermediate node acts as a deconfounder.
Fairness audits fail under missing protected labels, especially at zero access.
problem Understanding the reliability of fairness audits with incomplete protected-label data.
method Introduced a seed-calibrated stress test to separate missingness effects from seed-to-seed movement.
result Missing protected labels do not significantly alter fairness mitigation methods, but they can lead to harmful intersectional outcomes.
Curriculum Labeling improves semi-supervised learning with pseudo-labeling, achieving high accuracy with minimal labeled data.
problem Improving semi-supervised learning with limited labeled data.
method Applying curriculum learning principles and restarting model parameters before each self-training cycle.
result 94.91% accuracy on CIFAR-10 with only 4,000 labeled samples.
AutoElicit uses LLMs to quickly create expert priors for predictive models.
problem Creating accurate priors for predictive models is time-consuming and costly.
method AutoElicit extracts knowledge from LLMs to construct priors for predictive models.
result AutoElicit yields priors that reduce error and save labelling effort.
A new PLL method uses class activation values to improve robustness.
problem Weakly supervised learning with noisy data and adversarial perturbations.
method Subjective logic with class activation values for uncertainty representation and label weight re-distribution.
result More robust predictions under high noise levels, out-of-distribution examples, and adversarial perturbations.
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.
Transformers can be hijacked by context, but deeper models are more robust.
problem Robustness of Transformers against context hijacking for linear classification.
method Developed a theoretical analysis on the robustness of linear transformers, considering model depth, training context lengths, and number of hijacking context tokens.
result Deeper transformers are more robust to context hijacking.
Discrepancy between training and testing domains is a fundamental problem in the generalization of machine learning techniques. Recently, several approaches have been proposed to learn domain invariant feature representations through adversarial deep learning. However, label shift, where the percentage of data in each …
Market-Derived Financial Sentiment Analysis: Context-Aware Language Models for Crypto Forecastingcs.CE
Improved crypto market forecasting using historical price reactions to tweets.
problem Challenges in inferring market impact from human sentiment labels.
method Market-derived labeling approach to assign tweet sentiment labels based on historical price trends. Fine-tuned language model with context-aware prompt-tuning.
result 89.6% accuracy on Bitcoin news events, outperforming traditional fusion models.
Process mining is a research field focused on the analysis of event data with the aim of extracting insights in processes. Applying process mining techniques on data from smart home environments has the potential to provide valuable insights in (un)healthy habits and to contribute to ambient assisted living solutions. …
This paper investigates how transformers can learn to generalize to unseen examples in context.
problem Understanding how transformers can generalize to unseen examples in a prompt.
method Gradient descent analysis of one-layer multi-head transformers for in-context learning.
result The training loss for a one-layer multi-head transformer converges linearly to a global minimum, effectively learning ridge regression over basis functions.
Self-supervised learning improves EEG signal analysis without labeled data.
problem Limited labeled data in clinical EEG signals.
method Temporal context prediction and contrastive predictive coding tasks.
result SSL-learned features outperform supervised deep neural networks in low-labeled data regimes.
Introduces CStrees for modeling context-specific causal models from observational and interventional data.
problem Modeling context-specific causal relationships from mixed data types.
method Introduces CStrees with a novel factorization criterion and graphical characterization for context-specific conditional independence models.
result Derives a graphical characterization of model equivalence for observational CStrees and extends it to CStree models under context-specific interventions.