Hard instances, which require a long time for a specific algorithm to solve, help (1) analyze the algorithm for accelerating it and (2) build a good benchmark for evaluating the performance of algorithms. There exist several efforts for automatic generation of hard instances. For example, evolutionary algorithms have b…
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,982 papers · 148 categories
Trend · papers per month
48 results for “instance generation”
Improves GAN performance by identifying and removing harmful training instances.
problem Challenges in applying previous instance removal methods to GANs.
method Proposes influence estimation methods using Jacobian of generator's gradient and instance evaluation scheme based on GAN evaluation metrics.
result Removing harmful instances significantly improves GAN performance.
New method estimates harmful instances in GANs for better model performance.
problem Estimating harmful instances in GANs for improved model performance.
method Uses Jacobian of generator's loss to trace harmfulness of instances.
result Correctly inferred changes in GAN evaluation metrics and improved model performance.
Unsupervised image-to-image translation has gained considerable attention due to the recent impressive progress based on generative adversarial networks (GANs). However, previous methods often fail in challenging cases, in particular, when an image has multiple target instances and a translation task involves significa…
Algorithm generates adaptive confidence sets for instance segmentation with guaranteed coverage.
problem Uncalibrated predictions and lack of uncertainty quantification in instance segmentation models.
method Conformal prediction algorithm to generate adaptive confidence sets with provable guarantees.
result Empirically, prediction sets vary in size based on query difficulty and attain target coverage, outperforming baselines.
Not all instances in a data set are equally beneficial for inducing a model of the data. Some instances (such as outliers or noise) can be detrimental. However, at least initially, the instances in a data set are generally considered equally in machine learning algorithms. Many current approaches for handling noisy and…
ICE improves classification performance by leveraging internal patterns among instances.
problem Inconsistent results for different MCS algorithms on specific problems.
method ICE groups training data into overlapping clusters, builds classifiers for each cluster, and predicts class labels by averaging predictions from top-performing models.
result ICE provides a stable improvement on a significant proportion of datasets over existing MCS methods.
There are classification tasks that take as inputs groups of images rather than single images. In order to address such situations, we introduce a nested multi-instance deep network. The approach is generic in that it is applicable to general data instances, not just images. The network has several convolutional neural…
Generative-discriminative method improves label prediction and instance generation.
problem Difficulty in obtaining high-quality labeled instances.
method Generative-discriminative complementary learning method using CC-GAN.
result Improves accuracy in predicting ordinary labels and generating high-quality instances.
Paper proposes a method to generate instance labels from weakly supervised data.
problem Weakly supervised instance labeling in medical image analysis.
method Uses multiple instance learning (MIL) and knowledge distillation to generate instance-level predictions.
result Significantly outperforms state-of-the-art MIL methods in instance-level prediction.
New method improves weakly-supervised action localization.
problem Locating action segments in videos with limited labels.
method Explicitly models key instance assignment as hidden variable using EM framework.
result Achieves state-of-the-art performance on THUMOS14 and ActivityNet1.2 benchmarks.
The study provides theoretical foundations for using smaller instances to predict algorithm performance on larger ones.
problem Scalability challenge in evaluating algorithms on large instances.
method Formalized size generalization, providing theoretical guarantees for predicting algorithm performance on large instances using smaller, representative instances.
result Characterized the subsample size sufficient to ensure performance on the subsample reflects performance on the full instance.
RL agents fail to generalize to unseen environments, even when dynamics are similar.
problem RL agents fail to generalize to unseen environments despite similar dynamics.
method Analyzed policy learning in POMDPs, formalized training dynamics as instances, and introduced a shared belief representation over an ensemble of specialized policies.
result Maximizing rewards induces instance-specific policies that are suboptimal on the training set.
MARVEL curbs memorization of noisy labels in deep nets.
problem Noisy labels degrade deep net performance.
method MARVEL tracks classification margins to identify and abandon noisy instances.
result MARVEL outperforms baselines on noisy datasets.
SymNet uses neural models to solve RMDPs efficiently.
problem Limited effectiveness of generalized policies in RMDPs.
method SymNet trains shared parameters for an RDDL domain, converts instances to graphs, uses relational neural models for node embeddings, and scores actions based on embeddings.
result SymNet policies outperform random and state-of-the-art deep reactive policies on nine RDDL domains.
UCRL-WVTR tackles long-term reinforcement learning with general approximations, achieving horizon-free and instance-dependent regret bounds.
problem Long-term reinforcement learning with general function approximations.
method UCRL-WVTR proposes a novel algorithm, UCRL-WVTR, with weighted value-targeted regression and a high-order moment estimator.
result Achieves horizon-free and instance-dependent regret bounds matching minimax lower bounds up to logarithmic factors.
MixBoost generates synthetic instances to balance imbalanced datasets.
problem Training models on imbalanced datasets.
method Iterative data augmentation method that selects and combines instances from majority and minority classes.
result MixBoost outperforms existing approaches on 20 benchmark datasets.
New algorithm achieves instance-optimality in decision making.
problem Develop adaptive algorithms for interactive decision making.
method Introduce Allocation-Estimation Coefficient (AEC) and develop algorithm.
result First non-asymptotic instance-optimal performance guarantees.
New method generates adversarial examples with conditional GAN.
problem Vulnerability of deep neural networks to adversarial examples.
method Conditional Generative Adversarial Network (cGAN) for generating adversarial examples.
result Our models reduce generating cost and improve robustness.
A new method generates MAX-2-SAT instances with adjustable hardness.
problem Creating hard MAX-SAT instances for evaluating MAX-SAT solvers.
method Inspired by frustrated-loop algorithm, extends to bipartite couplings, tuning hardness through frustration index.
result Generated instances can be tuned through a central parameter (frustration index), showing double phase transition behavior.
We describe a novel weakly supervised deep learning framework that combines both the discriminative and generative models to learn meaningful representation in the multiple instance learning (MIL) setting. MIL is a weakly supervised learning problem where labels are associated with groups of instances (referred as bags…
Paper proposes a universal probabilistic model for handling instance-dependent label noise.
problem Instance-dependent label noise in data quality challenges DNN training robustness.
method Categorizes instances into confusing and unconfusing, proposes a probabilistic model.
result Significant improvements in robustness over state-of-the-art methods on various datasets.
Paper addresses instance-level label prediction in MIL, improving performance compared to existing methods.
problem Lack of instance-level label prediction in existing MIL approaches restricts their applicability.
method Proposes a novel algorithm with instance-level loss function, unbiasedly and consistently estimated.
result Empirically validated superior instance-level and bag-level performance compared to state-of-the-art methods.
We study learning latent models with multi-instance weak supervision.
problem Learning latent models with multi-instance weak supervision.
method Formulated as multi-instance Partial Label Learning (multi-instance PLL), proposed a necessary and sufficient condition for learnability, derived Rademacher-style error bounds.
result First theoretical study of multi-instance PLL with unknown transition function, aligns with empirical results but highlights scalability issues.
Simple Binary Hypothesis Testing under Local Differential Privacy and Communication Constraintsmath.ST
Study binary hypothesis testing with privacy and communication constraints.
problem Binary hypothesis testing under local differential privacy and communication constraints.
method Qualifies results as minimax or instance optimal, develops instance-optimal algorithms.
result Achieves minimum possible sample complexity under both privacy and communication constraints.
We propose a new formulation of Multiple-Instance Learning (MIL). In typical MIL settings, a unit of data is given as a set of instances called a bag and the goal is to find a good classifier of bags based on similarity from a single or finitely many "shapelets" (or patterns), where the similarity of the bag from a sha…
We present a comprehensive study of the use of generative modeling approaches for Multiple-Instance Learning (MIL) problems. In MIL a learner receives training instances grouped together into bags with labels for the bags only (which might not be correct for the comprised instances). Our work was motivated by the task …
A method to approximate instance-dependent label noise using instance-confidence embedding.
problem Real-world label noise that depends on individual instances.
method Variational approximation with instance embedding to capture instance-specific label corruption.
result ICE method effectively approximates instance-dependent noise and detects ambiguous instances.
In Machine Learning, ensemble methods have been receiving a great deal of attention. Techniques such as Bagging and Boosting have been successfully applied to a variety of problems. Nevertheless, such techniques are still susceptible to the effects of noise and outliers in the training data. We propose a new method for…
A new PU classifier PUAL tackles trifurcate data issues.
problem Training classifiers on trifurcate data containing only labeled-positive instances and unlabeled instances.
method PUAL classifier with asymmetric loss and kernel-based algorithm.
result PUAL achieves satisfactory classification on trifurcate data.
Paper tackles instance-dependent label noise by approximating it with part-dependent noise.
problem Learning with instance-dependent label noise is challenging.
method Approximate instance-dependent label noise with part-dependent noise. Use transition matrices for parts to model noise.
result Method outperforms state-of-the-art approaches for instance-dependent label noise.
A new SSL method uses instance-dependent thresholds to improve accuracy.
problem Improving semi-supervised learning by better selecting confident unlabeled instances.
method Proposes instance-dependent thresholds that vary based on the ambiguity and error rates of pseudo-labels for each unlabeled instance.
result Demonstrates that instance-dependent thresholds provide a probabilistic guarantee for correct pseudo-labels.
Classification is a fundamental problem in machine learning and data mining. During the past decades, numerous classification methods have been presented based on different principles. However, most existing classifiers cast the classification problem as an optimization problem and do not address the issue of statistic…
Meta-algorithm selection aims to choose the best algorithm selector for a given problem instance.
problem Selecting the best algorithm selector for a specific problem instance.
method Apply algorithm selection to the selection of other algorithms (meta-algorithm selection).
result Meta-algorithm selection can be beneficial in some cases but faces challenges in solving the meta-level problem.
M4L-JMF tackles multi-typed objects learning, improving on M3L.
problem Learning from multi-typed objects with diverse features and labels.
method Joint matrix factorization to encode and factorize multi-typed bags and their instances.
result M4L-JMF outperforms existing methods on benchmark datasets.
DRNets dynamically route instances to efficient transformations.
problem High inference costs due to static model capacity.
method Dynamic Routing Networks (DRNets) with RouterNets for branch selection.
result DRNets reduce inference costs with comparable performance.
Improves key instance detection in MIL models by using neural network inversion with sparseness constraint.
problem Limited key instance detection performance in attention-based deep MIL models due to skewed attention scores.
method Sparse network inversion with a sparseness constraint incorporated into neural network inversion, solved by proximal gradient method.
result Significantly improved key instance detection performance while maintaining bag-level prediction performance.
A deep RL approach generates counterfactual instances efficiently.
problem Efficient generation of counterfactual instances for large datasets and diverse models.
method Deep reinforcement learning to optimize counterfactual instances in a single forward pass.
result Model-agnostic and scalable counterfactual generation.
Labeling data for classification requires significant human effort. To reduce labeling cost, instead of labeling every instance, a group of instances (bag) is labeled by a single bag label. Computer algorithms are then used to infer the label for each instance in a bag, a process referred to as instance annotation. Thi…
A method uses confidence scores to handle noisy labels for each instance.
problem Learning with noisy labels where each instance's label can randomly change.
method Introduces confidence-scored instance-dependent noise (CSIDN) to estimate transition distributions for each instance.
result Demonstrates the utility and effectiveness of CSIDN through experiments with synthetic and real-world noise.
Recently neural networks and multiple instance learning are both attractive topics in Artificial Intelligence related research fields. Deep neural networks have achieved great success in supervised learning problems, and multiple instance learning as a typical weakly-supervised learning method is effective for many app…
New algorithms improve contextual bandit performance by adapting to problem difficulty.
problem Improving contextual bandit performance on problems with varying difficulty.
method Introducing complexity measures and oracle-efficient algorithms.
result Achieves optimal instance-dependent regret bounds for rich policy classes.
The paper analyzes how deep neural networks handle noisy labels and finds disparate impacts.
problem Disparate impacts of noisy labels on instances with different representation frequencies.
method Quantifying harms, analyzing solutions, and comparing their impacts on different frequency instances.
result Existing solutions lead to disparate treatments, benefiting higher-frequency instances more.
A model finds interpretable prototypes for MIL datasets.
problem Finding interpretable prototypes for multiple instance learning.
method Permutation invariant maximally predictive prototype generator.
result The model outperforms existing approaches in accuracy and efficiency.
Improves GAN sample quality by refining the training dataset.
problem GANs generate unrealistic samples outside the data manifold.
method Instance selection to improve sample quality and reduce training time.
result Significantly reduces training time and improves sample fidelity.
The paper investigates instance-based interpretation methods for VAEs.
problem Understanding how VAEs make predictions without supervision.
method Formally framed influence functions for VAEs and developed VAE-TracIn.
result Varying training samples significantly impacts VAE predictions.
Improved neural network robustness with instance-specific perturbation margins.
problem Adversarial training fails to generalize well to unperturbed test set.
method Instance adaptive adversarial training with sample-specific perturbation margins.
result Test accuracy improves with a marginal drop in robustness.
A new method handles label noise by leveraging causal information.
problem Label noise degrades deep learning performance.
method Proposes a novel generative approach using a structural causal model.
result Improves classifier performance on label-noise datasets.