Efficiently combines autoregressive and set-based models for joint distributions.
problem Joint distributions over multiple predictions from set-based models.
method Causal autoregressive buffer that caches context and captures dependencies.
result Up to 20x faster joint sampling and density evaluation, up to 7x lower memory usage.
Transformers show better in-context learning resilience under distribution shifts than simple MLPs.
problem Understanding in-context learning under varying distribution shifts.
method Comparing transformers and set-based MLPs on linear regression tasks.
result Transformers better emulate OLS performance and exhibit better resilience to mild distribution shifts.
Wind farm layout optimisation tackles space constraints with Bayesian multi-objective approach.
problem Optimizing wind farm layout due to limited space and conflicting objectives.
method Set-based multi-objective Bayesian optimisation using Gaussian process.
result Demonstrates potential of set-based Bayesian multi-objective optimisation for wind farm layout.
Paper proposes S-BOMM for optimization with multiple models, focusing on consistency.
problem Optimization challenges with multiple models of varying fidelity and accuracy.
method Set-Based Optimization with Multiple Models (S-BOMM) focusing on model consistency.
result Empirical results show S-BOMM's effectiveness in identifying good solutions across multiple models.
A test assesses the calibration of set-based epistemic uncertainty representations.
problem Evaluating the accuracy of set-based representations of epistemic uncertainty in machine learning.
method Proposes a novel statistical test to determine if a convex combination of predictions is calibrated, allowing instance-level variability.
result Demonstrates the benefits of capturing instance-level variability on synthetic and real-world experiments.
Survey on neural networks for set-based data.
problem Efficient processing of set-based inputs in machine learning.
method Exploration of Deep Sets and Transformers for set functions approximation.
result Deep Sets can be generalized by differences in aggregation function.
SparseSense improves HAR from sparse sensor data, outperforming state-of-the-art models.
problem Learning activity recognition from highly sparse sensor data streams.
method Set-based neural networks for end-to-end learning from sparse data.
result Significant performance improvements in HAR from passive sensor datasets.
MLI is an Application Programming Interface designed to address the challenges of building Machine Learn- ing algorithms in a distributed setting based on data-centric computing. Its primary goal is to simplify the development of high-performance, scalable, distributed algorithms. Our initial results show that, relativ…
A new neural subsampling method reduces data volume for deep models.
problem Efficiently process huge volumes of high-dimensional data like images.
method Two-stage end-to-end neural subsampling model that optimizes for arbitrary downstream tasks.
result Outperforms baselines under low subsampling rates on various tasks.
New method detects anomalies in computing centers' logs.
problem Anomaly detection in continuously changing log data for predictive maintenance.
method Evolving granular classifiers using Fuzzy-set-Based evolving Modeling and evolving Granular Neural Network.
result Classification model prioritizes maintenance based on anomaly severity.
Two batch Bayesian optimization algorithms with regret guarantees.
problem Efficiently optimizing multiple objectives in batch feedback settings.
method Gaussian process upper confidence bound and Thompson sampling approaches.
result Frequentist regret guarantees and numerical results.
A new framework for robust policy learning in MDPs with linear mixture dynamics.
problem Off-dynamics challenge in real-world decision-making problems.
method Linear mixture DRMDP framework, meta algorithm for robust policy learning.
result The new framework provides a more refined representation of uncertainties.
This paper considers the problem of inferring image labels from images when only a few annotated examples are available at training time. This setup is often referred to as low-shot learning, where a standard approach is to re-train the last few layers of a convolutional neural network learned on separate classes for w…
A method for non-projective dependency parsing without fixed edge order.
problem Non-projective dependency parsing without fixed edge order.
method Incremental edge prediction, blending graph, transition, and easy-first parsing.
result Successfully parses near state-of-the-art on projective and non-projective languages.
Study on generalization for data-dependent hypothesis sets.
problem Understanding generalization in hypothesis sets dependent on data.
method Learning guarantee based on transductive Rademacher complexity and hypothesis set stability.
result Generalization bound for data-dependent hypothesis sets.
A new method prunes neural networks faster and more efficiently.
problem Reducing training time and memory usage for neural networks.
method Set-based Task-Adaptive Meta Pruning (STAMP) that meta-learns a pruning mask.
result Significantly improved compression rates and faster training speed.
New federated f-differential privacy for collaborative learning.
problem Privacy in federated learning.
method Introducing federated f-differential privacy and proposing a generic private federated learning framework. result Proves federated f-differential privacy provides privacy guarantee on each record of one client's data. We describe MELEE, a meta-learning algorithm for learning a good exploration policy in the interactive contextual bandit setting. Here, an algorithm must take actions based on contexts, and learn based only on a reward signal from the action taken, thereby generating an exploration/exploitation trade-off. MELEE address…
In this paper, we propose a novel meta-learning method in a reinforcement learning setting, based on evolution strategies (ES), exploration in parameter space and deterministic policy gradients. ES methods are easy to parallelize, which is desirable for modern training architectures; however, such methods typically req…
Reduces overestimation bias in multi-agent RL, improving performance.
problem Value function overestimation bias in multi-agent RL.
method Double centralized critics to reduce overestimation bias.
result Significant improvement in performance on mixed tasks.
Improves MCMC performance with adaptive affine transformations.
problem Improving the performance of Markov Chain Monte Carlo samplers.
method Adaptive learning of bijective affine transformations during sampling.
result Adaptive affine transformations improve the quality of samples at low computational cost.
Learning a Bayesian network structure from data is an NP-hard problem and thus exact algorithms are feasible only for small data sets. Therefore, network structures for larger networks are usually learned with various heuristics. Another approach to scaling up the structure learning is local learning. In local learning…
In this paper, we consider nonlinear PDEs in a port-Hamiltonian setting based on an underlying jet-bundle structure. We restrict ourselves to systems with 1-dimensional spatial domain and 2nd-order Hamiltonian including certain dissipation models that can be incorporated in the port- Hamiltonian framework by means of a…
New algorithms tackle latent bandit problems with lower regret.
problem Learning optimal actions in a latent state setting.
method General algorithms based on UCBs and Thompson sampling, aware of model uncertainty.
result Our methods have lower regret than classic bandit policies when latent states are fewer than actions.
Proposes linking energy and force uncertainty in deep learning potentials.
problem Uncertainty in predicted energies and forces in machine learning models.
method Introduces a spatially correlated noise process to link energy and force uncertainty.
result Demonstrates the approach on molecular datasets, linking energy and force uncertainties.
CoCoRL learns safe constraints from demonstrations with unknown rewards.
problem Learning safe constraints from demonstrations with different unknown rewards.
method Convex Constraint Learning for Reinforcement Learning (CoCoRL) constructs a convex safe set based on demonstrations.
result CoCoRL learns constraints that lead to safe driving behavior and can safely transfer to different tasks and environments.
This paper develops a learning framework for optimal strategies in multi-stage decentralized matching markets.
problem Optimal strategies in multi-stage decentralized matching markets with uncertain preferences.
method Nonparametric statistical approach and variational analysis.
result Participants can be better off with multi-stage matching compared to single-stage matching.
Paper studies DRO with MMD uncertainty sets and reveals connections to regularization and generalization.
problem Addressing the limitations of existing DRO uncertainty sets in machine learning.
method Introduces DRO with uncertainty sets measured via maximum mean discrepancy (MMD) and derives connections to regularization and generalization.
result Obtains an alternative proof of a generalization bound for Gaussian kernel ridge regression via DRO lens and suggests a new regularizer.
CLS measures dataset similarity through decision rule performance.
problem Measuring dataset similarity in machine learning, especially for transfer learning and domain adaptation.
method Cross-Learning Score (CLS) measures similarity through bidirectional generalization performance of decision rules, linking to cosine similarity under canonical linear models.
result CLS effectively measures dataset similarity and transferability, validated on synthetic and real-world datasets.
Reinforcement learning with trajectory feedback instead of state-action rewards.
problem Frequent feedback not available in practice.
method Extended reinforcement learning algorithms using trajectory feedback for known and unknown transition models.
result Hybrid optimistic-Thompson Sampling algorithm for unknown transition models.
New risk measures improve machine learning robustness.
problem Improper estimation of data distribution leads to poor out-of-sample performance in machine learning.
method Developed a new framework from quantitative finance to recast the min-max problem as a convex minimization problem.
result Proposed efficient algorithms to solve the convex optimization problems involving complex constraints.
A nonparametric Bayesian extension of Factor Analysis (FA) is proposed where observed data Y is modeled as a linear superposition, G, of a potentially infinite number of hidden factors, X. The Indian Buffet Process (IBP) is used as a prior on G to incorporate sparsity and to …
Paper introduces PCP for efficient, reliable predictive inference.
problem Developing reliable predictive inference methods for target variables.
method Probabilistic conformal prediction using conditional random samples.
result PCP provides sharper predictive sets compared to existing methods.
Causal Mosaic distinguishes cause from effect using nonlinear ICA and ensemble methods.
problem Distinguishing cause from effect in bivariate settings.
method Nonlinear ICA and ensemble framework (Causal Mosaic).
result Causal Mosaic shows state-of-the-art performance on artificial and real-world datasets.
We consider the problem of improving the efficiency of randomized Fourier feature maps to accelerate training and testing speed of kernel methods on large datasets. These approximate feature maps arise as Monte Carlo approximations to integral representations of shift-invariant kernel functions (e.g., Gaussian kernel).…
We propose a strategy for approximating Pareto optimal sets based on the global analysis framework proposed by Smale (Dynamical systems, New York, 1973, pp. 531-544). The method highlights and exploits the underlying manifold structure of the Pareto sets, approximating Pareto optima by means of simplicial complexes. Th…
We consider parallel asynchronous Markov Chain Monte Carlo (MCMC) sampling for problems where we can leverage (stochastic) gradients to define continuous dynamics which explore the target distribution. We outline a solution strategy for this setting based on stochastic gradient Hamiltonian Monte Carlo sampling (SGHMC) …
Proposes a new model for handling missing data.
problem Nonignorable missingness in data.
method Variational autoencoder architecture with pattern-set mixtures.
result Achieves state-of-the-art imputation performance.
Fishnets improve set and graph learning with scalable, robust aggregation.
problem Learning informative embeddings for sets and graphs with scalable and robust aggregation.
method Proposes Fishnets, a new aggregation strategy for set-based learning.
result Fishnets achieve state-of-the-art performance on graph datasets with fewer parameters and faster training.
The paper refines and generalizes worst-case law invariant convex risk measures.
problem Developing robust convex risk measures under uncertainty sets.
method Generalizing closed forms for worst-case law invariant convex risk measures with uncertainty sets based on norms and moment constraints.
result Explicit closed forms for convex risk measures are developed and assessed through numerical simulations.
Online optimization has emerged as powerful tool in large scale optimization. In this paper, we introduce efficient online algorithms based on the alternating directions method (ADM). We introduce a new proof technique for ADM in the batch setting, which yields the O(1/T) convergence rate of ADM and forms the basis of …
The paper develops distribution-free methods for ordinal classification.
problem Constructing valid prediction sets for ordinal classification problems.
method Leveraging conformal prediction and multiple testing with FWER control.
result The proposed methods achieve satisfactory levels of marginal and class-specific conditional coverages.
FunBO uses LLMs to discover effective acquisition functions for Bayesian optimization.
problem Designing optimal acquisition functions for Bayesian optimization across diverse problems.
method FunBO leverages FunSearch, an LLM, to learn and evaluate new acquisition functions.
result FunBO discovers acquisition functions that generalize well and outperform existing methods.
Paper improves reinforcement learning efficiency with deterministic value gradients.
problem High sample complexity in model-free DDPG algorithms for continuous control tasks.
method Proposes DVG and DVPG algorithms with infinite horizon value gradients to improve sample efficiency.
result DVPG algorithm substantially outperforms state-of-the-art methods on continuous control benchmarks.
Evaluating generative adversarial networks (GANs) is inherently challenging. In this paper, we revisit several representative sample-based evaluation metrics for GANs, and address the problem of how to evaluate the evaluation metrics. We start with a few necessary conditions for metrics to produce meaningful scores, su…
CVPR 2020 challenge evaluates continual learning in computer vision.
problem Making AI systems more adaptive and efficient.
method Evaluated different continual learning approaches on a common hardware with shared metrics.
result Reported main results, finalists, and prize winners.
AsylADMM improves gossip-based learning for non-smooth objectives.
problem Efficient and robust decentralized learning on edge devices.
method Asynchronous gossip algorithm for non-smooth optimization.
result AsylADMM converges faster on non-smooth problems.
This paper analyzes risk-sensitive reinforcement learning with Conditional Value-at-Risk (CVaR) for robust Markov Decision Processes.
problem Risk-sensitive reinforcement learning for robust Markov Decision Processes (RMDPs) with state-action-dependent ambiguity sets.
method The paper establishes a connection between robustness and risk sensitivity, defining a new risk measure NCVaR and proposing value iteration algorithms.
result The proposed approach using NCVaR optimization and value iteration algorithms can solve problems with state-action-dependent ambiguity sets.