Paper organizes sampling methods for generative modeling.
problem Challenges in sampling with diffusion models.
method Reviews and organizes existing sampling methods.
result Reveals links between methods to overcome challenges.
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,738 papers · 148 categories
Trend · papers per month
48 results for “lack of diversity”
Generating molecules with desired chemical properties is important for drug discovery. The use of generative neural networks is promising for this task. However, from visual inspection, it often appears that generated samples lack diversity. In this paper, we quantify this internal chemical diversity, and we raise the …
Kernel sparsity ("dying ReLUs") and lack of diversity are commonly observed in CNN kernels, which decreases model capacity. Drawing inspiration from information theory and wireless communications, we demonstrate the intersection of coding theory and deep learning through the Grassmannian subspace packing problem in CNN…
New framework shows diverse training data improves subgroup and overall performance.
problem Lack of understanding how diverse training data affects subgroup and overall performance.
method Casts data collection as part of the learning process, analyzes dataset compositions, and guides dataset design.
result Diverse representation in training data improves subgroup and overall performance.
Pantypes improve prototypical models by capturing diverse input distributions.
problem Prototypical models lack sufficient data representation in low density regions.
method Introducing pantypes, a sparse set of diverse objects to represent the full diversity of input distribution.
result Pantypes empower prototypical models to foster high diversity, interpretability, and fairness.
MO-PaDGAN generates diverse, high-performance designs with multiple metrics.
problem Challenges in generating diverse, high-performance designs with multiple metrics.
method MO-PaDGAN uses a new Determinantal Point Processes based loss function for probabilistic modeling of diversity and performances.
result MO-PaDGAN expands the design space towards high-performance regions and generates new designs with high diversity and performances.
Standard practice in training neural networks involves initializing the weights in an independent fashion. The results of recent work suggest that feature "diversity" at initialization plays an important role in training the network. However, other initialization schemes with reduced feature diversity have also been sh…
Strongly log-concave (SLC) distributions are a rich class of discrete probability distributions over subsets of some ground set. They are strictly more general than strongly Rayleigh (SR) distributions such as the well-known determinantal point process. While SR distributions offer elegant models of diversity, they lac…
DMNL bandits optimize assortment choices balancing relevance and diversity.
problem Balancing relevance-driven choice with within-assortment diversity.
method Augments MNL choice probabilities with a submodular diversity function, proposing a white-box UCB-based algorithm.
result Achieves at least a -approximate regret bound of $ ilde{O}\left(d \sqrt{T/K}
ight)$.
δ-CLUE generates diverse explanations for model uncertainty.
problem Lack of constraints in generating explanations for uncertainty estimates.
method Augmenting CLUE approach to provide a set of plausible explanations.
result Returns a set of diverse inputs that yield confident predictions.
Proposes a method to generate diverse translations by conditioning on target domain.
problem NMT models lack diversity in translations, even with search algorithms.
method Condition the decoder on a latent variable representing target domain, generated by a target encoder.
result Generated diverse translations without affecting performance or training time.
While Generative Adversarial Networks (GANs) have empirically produced impressive results on learning complex real-world distributions, recent works have shown that they suffer from lack of diversity or mode collapse. The theoretical work of Arora et al. suggests a dilemma about GANs' statistical properties: powerful d…
PaDGAN generates diverse, high-quality designs with improved performance.
problem Lack of diversity and performance improvement in generated designs.
method Integrates Determinantal Point Processes for diversity and quality, using GAN framework.
result PaDGAN generates higher quality designs with better diversity and without mode collapse.
New theory explains GAN's high quality but low diversity.
problem Lack of theoretical justification for non-saturating GAN training.
method Showed non-saturating GAN training approximately minimizes a specific f-divergence.
result Non-saturating GAN training minimizes a particular f-divergence.
The study identifies latent concepts from diverse observations without assuming specific models.
problem Lack of general theoretical support for concept learning.
method Develops a nonparametric framework for identifying latent concepts from multiple classes of observations.
result Correctness guarantees for concept identification without parametric assumptions.
Improves diversity of text-to-image models without sacrificing FID.
problem Lack of diversity and tendency to recreate training set images.
method Adds sparse repellency terms to diffusion SDE to guide trajectories away from a reference set.
result Improves diversity of diffusion models with minimal impact on FID.
GIFT-Eval benchmarks time series forecasting models across diverse datasets.
problem Lack of comprehensive benchmarks for evaluating time series foundation models.
method Developed GIFT-Eval, a benchmark with 23 datasets, 177 million data points, and 144,000 time series.
result Promotes evaluation of foundation models across various domains and frequencies.
Novel methods generate diverse policies in reinforcement learning.
problem Generating diverse policies in reinforcement learning.
method Constrained optimization perspective, introducing new metrics, and novel policy generation methods.
result Improved novelty and performance of generated policies.
FairGround offers a diverse dataset corpus for fair ML research.
problem Lack of diverse, well-annotated datasets in fair ML research.
method Unified framework and Python package for reproducible fair ML research.
result Advances reproducibility and generalizability of fair ML research.
We prove Transformers can learn diverse Gröbner bases.
problem Training Transformers for Gröbner basis computation.
method Prove generality of dataset generation algorithm; propose extended algorithm.
result Datasets are sufficiently general for diverse Gröbner bases learning.
State representation learning aims at learning compact representations from raw observations in robotics and control applications. Approaches used for this objective are auto-encoders, learning forward models, inverse dynamics or learning using generic priors on the state characteristics. However, the diversity in appl…
InvestorBench benchmarks LLM agents in financial tasks.
problem Lack of a comprehensive benchmark for LLM-based financial agents.
method Developed a benchmark with diverse financial tasks and datasets.
result Evaluated LLM agents' performance across various financial products and market environments.
Few-shot classification refers to learning a classifier for new classes given only a few examples. While a plethora of models have emerged to tackle it, we find the procedure and datasets that are used to assess their progress lacking. To address this limitation, we propose Meta-Dataset: a new benchmark for training an…
Recent advances in conditional image generation tasks, such as image-to-image translation and image inpainting, are largely accounted to the success of conditional GAN models, which are often optimized by the joint use of the GAN loss with the reconstruction loss. However, we reveal that this training recipe shared by …
We explore the use of Vector Quantized Variational AutoEncoder (VQ-VAE) models for large scale image generation. To this end, we scale and enhance the autoregressive priors used in VQ-VAE to generate synthetic samples of much higher coherence and fidelity than possible before. We use simple feed-forward encoder and dec…
Applying deep learning methods to mammography assessment has remained a challenging topic. Dense noise with sparse expressions, mega-pixel raw data resolution, lack of diverse examples have all been factors affecting performance. The lack of pixel-level ground truths have especially limited segmentation methods in push…
New method uses SHapley Additive Explanations to identify anomaly detectors with complementary behaviors.
problem Challenges in unsupervised anomaly detection due to diverse data distributions and lack of labels.
method Characterize anomaly detectors using SHapley Additive Explanations to measure feature importance and similarity.
result Detectors with similar explanations produce correlated anomaly scores, while those with divergent explanations are complementary.
This work improves autonomous racing by creating diverse opponents and adapting risk.
problem Balancing performance and safety in autonomous racing environments.
method Developed a self-play method using replica-exchange Markov chain Monte Carlo for diverse opponents and a distributionally robust bandit optimization for adaptive risk adjustment.
result Demonstrated real-time motion-planning methods achieving speeds comparable to Formula One racecars.
Multi-SpaCE generates valid counterfactual explanations for multivariate time series data.
problem Lack of transparency in deep learning models for multivariate time series data.
method Multi-objective counterfactual explanation method using NSGA-II for multivariate time series data.
result Ensures perfect validity and superior performance compared to existing methods.
Generative Fractional Diffusion Models improve image diversity and quality.
problem Diffusion models struggle with diversity, mode-collapse, and slow convergence.
method Replaces light-tailed BM with fractional Brownian motion (fBM) and its Markov approximation (MA-fBM).
result GFDM achieves greater diversity and quality in image generation.
Proposes DILATE and STRIPE++ for precise time series forecasting.
problem Non-stationary signals with sudden changes.
method Incorporates shape and temporal criteria in deep learning models.
result Improves precision in deterministic and probabilistic forecasting.
New method estimates individual treatment effects using domain generalization.
problem Estimating causal individual treatment effects from observational data with treatment bias.
method Invariant Risk Minimization (IRM) framework to learn predictors invariant to domain-dependent factors.
result IRM-based ITE estimator shows gains over classical regression approaches in settings with pronounced support mismatch.
ePF improves PF for ITS by balancing exploration and exploitation, outperforming baselines.
problem Premature exploitation in PF leads to suboptimal solutions under constrained budgets.
method Integrates Entropic Annealing and Look-ahead Modulation to preserve diversity and evaluate potential.
result Significant improvement in task reward (up to 50% relative) on math benchmarks.
The paper analyzes trading strategies in a competitive market with incomplete information.
problem Strategic trading under uncertainty when firms lack full knowledge of competitors' strategies.
method Bayesian games framework to incorporate uncertainty and derive optimal trading strategies.
result Uncertainty significantly impacts trading strategies compared to complete information scenarios.
Improved scaffold generation for protein motifs using SE(3) flow matching.
problem Lack of structural diversity in generated scaffolds for protein motifs.
method Extended FrameFlow for motif-scaffolding with motif amortization and motif guidance.
result 2.5 times more designable and unique motif-scaffolds compared to state-of-the-art.
Study breaks down graphs into structural and featural components for task-agnostic data valuation.
problem Lack of methods to assess the value of graphs in data marketplaces.
method Introduces blind message passing framework to evaluate graphs without specific task metrics.
result Demonstrates effectiveness in capturing structural disparities, relevance, and diversity of seller data for buyers.
CTSyn generates high-quality synthetic tabular data.
problem Challenges in generating high-quality synthetic tabular data.
method Diffusion-based generative foundation model with autoencoder and conditional latent diffusion.
result CTSyn outperforms existing table synthesizers on standard benchmarks.
ProGen models protein sequences for synthetic biology.
problem Generating proteins without structural annotations.
method Trained a 1.2B-parameter language model on 280M protein sequences.
result ProGen generates proteins with fine-grained control and accuracy.
Enhances random forests by smoothing predictions for better performance.
problem Suboptimal performance due to piecewise constant predictions in random forests.
method Kernel-based smoothing mechanism to introduce local regularity.
result Smoothed random forest model consistently improves predictive performance.
We consider the problem of segmenting a large population of customers into non-overlapping groups with similar preferences, using diverse preference observations such as purchases, ratings, clicks, etc. over subsets of items. We focus on the setting where the universe of items is large (ranging from thousands to millio…
Anomaly detection is often considered a challenging field of machine learning due to the difficulty of obtaining anomalous samples for training and the need to obtain a sufficient amount of training data. In recent years, autoencoders have been shown to be effective anomaly detectors that train only on "normal" data. G…
Deep neural networks (DNN) are versatile parametric models utilised successfully in a diverse number of tasks and domains. However, they have limitations---particularly from their lack of robustness and over-sensitivity to out of distribution samples. Bayesian Neural Networks, due to their formulation under the Bayesia…
Unified evaluation framework for sampling methods.
problem Lack of a standardized evaluation framework for sampling methods.
method Introduces a benchmark suite and performance criteria for sampling methods.
result Insights into strengths and weaknesses of existing sampling methods.
Meta-learning techniques like MAML and Reptile fail to generalize well to out-of-distribution tasks compared to simple finetuning.
problem Generalization of meta-learning techniques in low-data scenarios.
method Investigation of MAML, Reptile, and finetuning on various tasks.
result MAML and Reptile specialize for fast adaptation but fail to generalize to out-of-distribution tasks.
Proposes DRIG for robust predictions using noise interventions.
problem Developing robust prediction models against distribution shifts.
method Distributional Robustness via Invariant Gradients (DRIG) exploiting general noise interventions.
result DRIG yields robust predictions among a data-dependent class of distribution shifts.
OTAD uses optimal transport to create robust models against adversarial attacks.
problem Vulnerability of deep neural networks to adversarial perturbations.
method OTAD combines optimal transport and Lipschitz networks to create a robust model.
result OTAD outperforms other robust models on diverse datasets.
New framework bridges climate science and ML for easier climate model emulation.
problem High computational costs and mistrust of ML methods in climate models.
method Integrating climate science and machine learning perspectives to design easy-to-adopt emulators.
result Demonstrated reliability of emulators designed to address specific tasks.
OpenDataVal benchmarks data valuation algorithms for diverse datasets.
problem Improving model performance and mitigating biases in training datasets.
method Unified benchmark framework for data valuation algorithms.
result No single algorithm performs uniformly best across all tasks.