Generative model learns diverse fixes for program errors.
problem Uncertainty in predicting a single fix for program errors.
method Deep conditional variational autoencoder with diversity regularizer.
result Strong improvements over state-of-the-art approaches, generating up to 45% diverse fixes.
Meta-learning performance improved by keeping support sets fixed.
problem Effect of support set diversity on meta-learning performance.
method Fixed support sets across tasks in meta-learning.
result Not only does not reduce performance, but almost always improves it.
This work studies the impact of intra-/inter-class diversity on pre-training datasets and finds a balance for optimal performance.
problem The impact of intra-/inter-class diversity on supervised pre-training datasets and their effect on downstream tasks.
method Empirical study and theoretical analysis of the relationship between diversity types and downstream performance.
result The optimal class-to-sample ratio is invariant to the size of the pre-training dataset and can be predicted.
Algorithm identifies best arm with prior info in structured bandits.
problem Bayesian fixed-budget best-arm identification in structured bandits.
method Prior-dependent allocations based on structure and prior information.
result Improved theoretical bounds and robust performance across diverse models.
Advances in Deep Reinforcement Learning have led to agents that perform well across a variety of sensory-motor domains. In this work, we study the setting in which an agent must learn to generate programs for diverse scenes conditioned on a given symbolic instruction. Final goals are specified to our agent via images o…
New method learns diverse protein scaffolds for motif design.
problem Designing long, diverse protein scaffolds for specific motifs.
method E(3)-equivariant graph neural network for diffusion modeling.
result First to guarantee conditional sampling from diffusion models.
Improved AMM protocol supports diverse loan maturities in DeFi.
problem Challenges in designing AMMs for fixed-income lending with time-related complexities.
method Generalized BondMM protocol to support arbitrary maturities.
result BondMM-A protocol demonstrates superior performance in interest rate stability and financial robustness.
Enhanced synthetic dataset improves asset allocation analysis.
problem Lack of realistic synthetic data for fixed income portfolio construction.
method Improved CorrGAN model for synthetic correlation matrices and Encoder-Decoder model for additional data conditioning.
result Synthetic dataset enhances portfolio construction and asset allocation analysis.
New method creates diverse neural ensembles for better uncertainty estimation and robustness.
problem Creating more robust neural networks for uncertainty estimation and dataset shift.
method Automatically constructing ensembles with varying architectures.
result Ensembles with varying architectures outperform deep ensembles in accuracy, uncertainty calibration, and robustness.
We consider a scenario where an agent has multiple available strategies to explore an unknown environment. For each new interaction with the environment, the agent must select which exploration strategy to use. We provide a new strategy-agnostic method that treat the situation as a Multi-Armed Bandits problem where the…
Meta-learning performance is affected by how task diversity is allocated, not just overall variability.
problem Meta-learning performance degrades when task diversity is unevenly distributed.
method Decomposed task-specific regression effects into structurally informative and orthogonal components.
result Meta-learning prediction degrades when a larger fraction of task variability is orthogonal and non-informative.
New algorithms for model selection in linear contextual bandits without feature diversity conditions.
problem Model selection in linear contextual bandits without feature diversity conditions.
method Data-adaptive algorithms that provide model selection guarantees without feature diversity conditions.
result O(d^α T^{1-α}) model selection guarantees with no feature diversity conditions.
Study optimal stopping for group with diverse discount rates using an attitude function.
problem Optimal stopping for a group with diverse discount rates under an aggregation preference.
method Develop iterative approach using consistent planning for time-consistent equilibria.
result Characterize all time-consistent mild equilibria as fixed points of an operator.
APGAI identifies good arms anytime with fixed budget.
problem Identifying a good arm with a fixed sampling budget.
method An anytime algorithm for good arm identification in stochastic bandits.
result APGAI achieves efficient detection of good arms with upper bounds on probability of error and sampling complexity.
Identifies latent actions and dynamics from offline data with diverse demonstrators.
problem Recovering latent actions and environment dynamics from action-free trajectories.
method Assumes distinct policies for each demonstrator, identifies latent transitions and policies via matrix factorization.
result Identifies latent transitions and demonstrator policies up to permutation.
New method designs joint initial noises for diffusion models to improve diversity and alignment.
problem Independent initial noises limit diversity in generated images.
method Coupling of initial noises, maintaining Gaussian distribution while allowing dependence.
result Repulsive Gaussian coupling improves diversity without increasing sampling cost.
Social learning can make financial markets inefficient, but individual learning can fix this.
problem Inefficiencies in financial markets due to social learning.
method Study of the Minority Game model with social and individual learning mechanisms.
result Individual learning can rescue a population from the inefficiencies caused by social learning.
DEN learns diverse tasks to generalize to unseen tasks.
problem Generalization from a diverse set of classification tasks with limited data.
method Three-block architecture: covariate transformation, distribution embedding, and classification.
result DEN outperforms existing methods in various synthetic and real tasks.
Optimized RL algorithms perform well on offline datasets, outperforming fully trained agents.
problem Improving reinforcement learning performance on offline datasets.
method Random Ensemble Mixture (REM) algorithm for Q-learning, trained on DQN replay dataset.
result Offline REM outperforms strong RL baselines and fully trained DQN agent.
ManifoldMind uses adaptive-curvature probabilistic spheres for trustworthy recommendations in semantic hierarchies.
problem Sparse and abstract recommendation domains where users explore diverse conceptual paths.
method Adaptive-curvature probabilistic spheres, soft multi-hop inference, and curvature-aware semantic kernel.
result Superior NDCG, calibration, and diversity compared to baselines on public benchmarks.
This work evaluates task-agnostic exploration methods for fixed-batch learning.
problem Expensive real-world experience for robotics tasks.
method Fixed datasets for arbitrary task learning.
result Improved offline learning for robotics tasks.
VILD learns policies from mixed-quality demonstrations by modeling expert levels.
problem Challenges in learning from diverse-quality demonstrations.
method Explicitly models expert levels with a probabilistic graphical model and variational approach.
result VILD outperforms state-of-the-art methods in continuous-control benchmarks.
LLMs struggle to optimize hyperparameters efficiently, but hybrid methods can improve performance.
problem Optimizing hyperparameters of small language models using LLMs.
method Comparison of classical HPO algorithms and LLM-based methods, introducing Centaur hybrid approach.
result Hybrid Centaur approach achieves best results, outperforming classical and pure LLM methods.
Transformers learn to use induction heads or shortcuts based on data diversity.
problem How data diversity influences the behavior of transformers.
method Gradient-based training of a single-layer transformer on a minimal task.
result Data diversity steers transformers toward induction heads or shortcuts.
Bayesian optimization improves efficiency with semi-supervised learning.
problem Efficiently find global optima of expensive functions.
method Density ratio estimation combined with semi-supervised learning.
result Improved accuracy in identifying global optima with unlabeled data.
In this study, we introduce a new approach to combine multi-classifiers in an ensemble system. Instead of using numeric membership values encountered in fixed combining rules, we construct interval membership values associated with each class prediction at the level of meta-data of observation by using concepts of info…
Proposes a tail-adaptive shrinkage method for robust sparse estimation.
problem Robust Bayesian methods for high-dimensional regression under diverse sparse regimes.
method Global-local-tail (GLT) Gaussian mixture distribution with tail-adaptive shrinkage.
result GLT posterior contracts at minimax optimal rate for sparse normal mean models.
Determinantal Point Processes (DPPs) are popular models for point processes with repulsion. They appear in numerous contexts, from physics to graph theory, and display appealing theoretical properties. On the more practical side of things, since DPPs tend to select sets of points that are some distance apart (repulsion…
Generative model uses random weighted support points for interpretable data sampling.
problem Creating diverse and interpretable sample sets from large datasets efficiently.
method Random weighted support points from Dirichlet process and Bayesian bootstrap.
result High-quality and diverse outputs at lower computational cost.
This work improves molecular design by efficiently selecting diverse candidate molecules.
problem Designing molecules that satisfy multiple conflicting objectives.
method A modular 'generate-then-optimize' framework using generative models and a novel acquisition function.
result Significant improvements in sample efficiency across synthetic and application-driven tasks.
EHVI outperforms scalarized EI in MOBO for molecule design.
problem Benchmarking MOBO strategies for molecule design.
method Compared EHVI against fixed-weight scalarized EI in MOBO.
result EHVI consistently outperforms scalarized EI in molecular optimization tasks.
G-FIGS uses instance weights to create interpretable models from diverse data.
problem Generalizing to diverse data distributions while maintaining interpretability.
method Estimates group membership probabilities, uses as instance weights in FIGS to grow decision trees.
result Achieves state-of-the-art prediction performance and maintains interpretability.
We propose a new algorithm for training generative adversarial networks that jointly learns latent codes for both identities (e.g. individual humans) and observations (e.g. specific photographs). By fixing the identity portion of the latent codes, we can generate diverse images of the same subject, and by fixing the ob…
New theory shows how multi-head attention reduces variance and decorrelates outputs.
problem Understanding and optimizing multi-head attention in neural networks.
method Developed a statistical theory linking multi-head attention to ensemble Nadaraya-Watson estimators.
result MHA variance reduction depends on head decorrelation, not just head count.
Research reveals how diversity impacts ensemble generalization in classification tasks.
problem Understanding the relationship between diversity and generalization in classification ensembles.
method Investigated diversity measurement, its relationship with generalization error, and pruning methods.
result Generalization error is reduced effectively only when diversity is increased in specific ranges, not in others.
Accurate taxi demand-supply forecasting is a challenging application of ITS (Intelligent Transportation Systems), due to the complex spatial and temporal patterns. We investigate the impact of different spatial partitioning techniques on the prediction performance of an LSTM (Long Short-Term Memory) network, in the con…
Adaptive anchor methods improve multi-modal learning by balancing intra-modal and inter-modal information.
problem Fixed anchor methods limit multi-modal learning by over-reliance on a single modality and inadequate cross-modal correlation.
method Adaptive anchor methods using centroid-based anchors from all modalities.
result Adaptive anchor methods like CentroBind consistently outperform fixed anchor methods across various datasets.
New approach for optimal stopping under model ambiguity, considering agent's attitude towards ambiguity.
problem Optimal stopping under model ambiguity and varying levels of ambiguity aversion.
method Introduces a time-inconsistent stopping problem with an α-maxmin nonlinear expectation and seeks subgame perfect equilibrium policies through fixed-point iterations. result Equilibrium stopping policies can be obtained through fixed-point iteration and vary based on an agent's ambiguity attitude.
Variance-Calibrated Modulation (VCM) addresses the likelihood trap in LLMs by reshaping the probability distribution before truncation.
problem LLMs fall into the likelihood trap, leading to repetitive degeneration and vocabulary dullness.
method VCM reshapes the probability distribution before truncation through Contextual Searchlight and Adaptive Self-Debiasing.
result VCM mitigates the likelihood trap across open-ended generation, factual QA, and mathematical reasoning.
A new algorithm learns diverse policies in reinforcement learning.
problem Learning diverse behaviors in reinforcement learning.
method Proposes Maximum Entropy Diverse Exploration (MEDE) algorithm.
result The set of policies learned by MEDE capture the same modalities as the optimal maximum entropy policy.
LUNA improves linear attention for long sequences without sacrificing accuracy.
problem Quadratic computational cost of softmax attention in long-sequence domains.
method LUNA learns a learnable kernel feature map to reduce attention cost to linear while maintaining accuracy.
result LUNA achieves state-of-the-art performance on the LRA and excels at post-hoc conversion.
LEMs extend transformer-based architectures for complex execution problems.
problem Handling flexible time boundaries and multiple execution constraints in deep learning.
method Decouples market information processing from execution allocation decisions using TKANs, VSNs, and multi-head attention mechanisms.
result LEMs achieve superior execution performance compared to traditional benchmarks.
This paper explores how diverse neural network ensembles improve prediction accuracy and robustness against deception.
problem Improving prediction accuracy and robustness of neural networks against adversarial attacks.
method Examines and measures ensemble diversity, develops algorithms for creating and combining diverse ensembles.
result Greater diversity in neural network ensembles leads to higher accuracy and robustness against deception.
Proposes method to discover diverse near-optimal policies in reinforcement learning.
problem Finding different solutions to the same problem in reinforcement learning.
method Formalizes problem as CMDP, uses Successor Features, proposes new diversity rewards.
result Proposed method discovers diverse near-optimal policies that are robust and distinct.
New model improves diversity in question generation over text.
problem Inadequate evaluation metrics for diverse questions.
method Proposed a variational encoder-decoder model and evaluation scheme.
result Improved diversity in generated questions without loss of quality.
Unified theory explains diversity in ensemble learning.
problem Explaining diversity in ensemble learning across various scenarios.
method Developed a framework revealing diversity as a hidden dimension in bias-variance decomposition.
result Proved exact bias-variance-diversity decompositions for multiple losses in regression and classification.
Learning algorithms are enabling robots to solve increasingly challenging real-world tasks. These approaches often rely on demonstrations and reproduce the behavior shown. Unexpected changes in the environment may require using different behaviors to achieve the same effect, for instance to reach and grasp an object in…
NPAS trains neural networks with a fixed parameter budget, improving performance and compactness.
problem Training neural networks requires memory, and existing methods struggle with arbitrary parameter budgets.
method NPAS learns to share parameters automatically, covering low and high budgets.
result NPAS and SSNs improve network performance and compactness across various tasks.