AI agent learns to handle unknown unknown states in reinforcement learning.
problem Handling unexpected, previously unseen states in reinforcement learning.
method Proposes EMDP-GA model with NIVE approach to expand value functions.
result Asymptotically consistent regret and comparable computational complexity.
New method tackles unknown unknowns in machine learning.
problem Unknown classes in training data misperceived as other labels.
method Exploratory machine learning with rejection model, feature exploration, and model cascade.
result The method discovers potentially hidden classes and improves model performance.
New method models unknown systems with hidden parameters using neural networks.
problem Modeling unknown dynamical systems with hidden parameters.
method Training a deep neural network (DNN) model using trajectory data of the unknown system.
result DNN model accurately predicts unknown dynamical systems with new initial conditions.
Identification of patterns from discrete data time-series for statistical inference, threat detection, social opinion dynamics, brain activity prediction has received recent momentum. In addition to the huge data size, the associated challenges are, for example, (i) missing data to construct a closed time-varying compl…
Over the past decades, researchers and ML practitioners have come up with better and better ways to build, understand and improve the quality of ML models, but mostly under the key assumption that the training data is distributed identically to the testing data. In many real-world applications, however, some potential …
Improved object classification using neural networks with known and unknown features.
problem Improving classification accuracy for objects described by both known and unknown features.
method Modernized Informational Neurobayesian Approach with consideration of unknown features.
result The method completely solved the problem of misclassification for queries with combining known and unknown features.
We develop an unsupervised, nonparametric, and scalable statistical learning method for detection of unknown objects in noisy images. The method uses results from percolation theory and random graph theory. We present an algorithm that allows to detect objects of unknown shapes and sizes in the presence of nonparametri…
DUE framework models unknown equations from data using deep learning.
problem Unknown equations in complex systems.
method Data-driven modeling using deep learning techniques.
result Framework capable of learning various types of unknown equations.
Paper develops PAC-Bayes bounds for unknown linear systems.
problem Learning controllers for unknown stochastic linear discrete-time systems.
method PAC-Bayes framework for data-dependent high probability bounds.
result Proposes efficient learning algorithms with theoretical guarantees.
Algorithm minimizes regret while adhering to unknown safety constraints.
problem Online learning with unknown safety constraints.
method General meta-algorithm leveraging online regression and learning oracles.
result Concrete algorithm with T \sqrt{T} T regret for linear constraints. Neural network residuals isolate and locate unknown faults.
problem Locating unknown faults in industrial systems.
method Neural network-based residuals combining physical insights and machine learning.
result Neural network residuals can isolate and locate unknown faults.
RTSCV detects unknown unknowns to improve model performance.
problem Model deficiency due to incomplete training data.
method Random Test Sampling and Cross-Validation (RTSCV) framework.
result Reduces performance gap by up to 41%.
Method learns model for unknown stochastic system from data.
problem Modeling unknown stochastic dynamical systems.
method Autoencoder approach using deep neural networks (DNNs).
result Decoder serves as a predictive model for unknown stochastic systems.
New method infers causal effects without knowing control variables.
problem Inference errors when control variables are unknown.
method Proposes a method for inferring causal effects when control variables are unknown.
result Proves method yields asymptotically valid confidence intervals for average causal effects.
Safety filter for unknown discrete-time systems with learned models and noise covariance.
problem Ensuring safety for unknown discrete-time linear systems with Gaussian noise.
method Develops a learning-based safety filter using empirical model and noise covariance, optimizing control actions to stay within safety constraints.
result Minimally modifies nominal control actions to ensure safety with high probability, tightening constraints as more data is collected.
This work extends Ledoit-Wolf shrinkage to unknown mean covariance estimation.
problem Large dimensional covariance matrix estimation with unknown mean under Kolmogorov asymptotics.
method Extending Ledoit-Wolf linear shrinkage to translation-invariant estimators, proving their convergence properties.
result A new estimator outperforms other standard estimators empirically.
Constructs non-asymptotic confidence regions for unknown functions in RKHS.
problem Global probabilistic confidence regions for unknown functions in RKHS.
method Reduces confidence region construction to estimating RKHS norm.
result Valid confidence regions can be constructed non-asymptotically.
Optimal algorithm for contextual bandits with unknown context distributions.
problem Designing efficient algorithms for contextual bandits with unknown context distributions.
method Cross-learning setting, novel technique for coordinating multiple epochs.
result Nearly tight regret bound of O ~ ( T K ) \widetilde{O}(\sqrt{TK}) O ( T K ) for learning to bid in first-price auctions and sleeping bandits. FML uses neural networks to model unknown systems accurately.
problem Modeling unknown dynamical systems with incomplete data.
method Flow map learning (FML) combined with deep neural networks.
result Accurate predictive models for partially observed systems.
Algorithm learns similarities to optimize bandit decisions in unknown metric space.
problem Optimizing decisions in unknown metric space with nonparametric reward functions.
method Data-driven similarities for adaptive partitioning of context-arm space.
result Regret bounds highlight algorithm's dependence on reward functions' local geometry.
New algorithm recovers matrices with unknown correspondences.
problem Recovering matrices from observations with unknown correspondences.
method Solves a nuclear norm minimization problem via proximal gradient with a Max-Oracle.
result Achieves state-of-the-art performance and high accuracy in recovering ground-truth correspondences.
Assessing the predictive accuracy of black box classifiers is challenging in the absence of labeled test datasets. In these scenarios we may need to rely on a human oracle to evaluate individual predictions; presenting the challenge to create query algorithms to guide the search for points that provide the most informa…
New algorithm detects changes in Markov kernels with unknown post-change kernel.
problem Detecting changes in Markov kernels with unknown post-change kernel.
method Developed a new change detection algorithm assuming uniform ergodicity.
result Derived upper and lower bounds on mean delay and time between false alarms.
Bayesian method synthesizes barrier certificates for unknown systems with latent states.
problem Certifying safety in systems with unknown dynamics and latent states.
method Bayesian inference with Metropolis-Hastings sampler and sum-of-squares program.
result Probabilistic validity of barrier certificates for unknown systems.
New method identifies latent causal graphs without parametric assumptions.
problem Identifying latent causal graphs without parametric assumptions.
method Constructive proofs with new graphical concepts.
result Conditions for nonparametric identification of latent causal graphs.
Proposes using equivariant generative models for compressed sensing with unknown orientations.
problem Recovering signals with unknown orientations from underdetermined systems of linear measurements.
method Equivariant variational autoencoder as a generative prior for compressed sensing.
result Signals with unknown orientations can be recovered using iterative gradient descent on the latent space of equivariant models.
A new GP framework for discovering unknown functions and hypergraph structure.
problem Discovering unknown functions and hypergraph structure in data.
method Interpretable Gaussian Process framework for Type 3 problems.
result Polynomial complexity for data-driven discovery of unknown functions and hypergraph structure.
Efficient algorithm for unknown linear systems with convex costs.
problem Controlling an unknown linear system with stochastic convex costs.
method Optimism in the Face of Uncertainty paradigm.
result Achieves optimal T \sqrt{T} T regret-rate. Paper tackles unknown variances in best-arm identification.
problem Identifying the best arm with unknown variances in Gaussian distributions.
method Two approaches: empirical variance plugging or adapting transportation costs.
result The impact of unknown variances is small on sample complexity.
Paper tackles open set domain adaptation by detecting unknown classes.
problem Adapting to target domains with unknown classes when label spaces partially overlap.
method Instance-level reweighting strategy combined with Extreme Value Theory for unknown class detection.
result Proposed method outperforms state-of-the-art models on conventional datasets.
BaCaDI discovers causal structures from unknown interventions.
problem Inferring causal structures from unknown interventions with limited data.
method Bayesian framework with gradient-based variational inference.
result BaCaDI outperforms related methods in identifying causal structures and intervention targets.
Paper introduces method to estimate animal motion on unknown submanifolds using Koopman operator.
problem Estimating animal motion on unknown submanifolds in high-dimensional space.
method Data-dependent approximation of Koopman operator in RKHS over ambient space.
result Strong rates of convergence derived for estimates in terms of fill distance.
Generative ODE model learns unknown variables in medical systems.
problem Estimating unknown variables in complex medical systems.
method Variational autoencoder incorporating known ODE functions.
result Modeling known-unknowns improves system parameter discovery and extrapolation.
Markowitz' celebrated optimal portfolio theory generally fails to deliver out-of-sample diversification. In this note, we propose a new portfolio construction strategy based on symmetry arguments only, leading to "Eigenrisk Parity" portfolios that achieve equal realized risk on all the principal components of the covar…
New method optimizes unknown functions adaptively.
problem Tuning hyperparameters in machine learning.
method Gradually and adaptively optimizing an unknown function using estimated gradients.
result Advantages for tuning high dimensional hyperparameters in machine learning.
Study online learning in unknown Markov games with sublinear regret.
problem Online learning in unknown Markov games with unobservable opponents.
method Introduced an algorithm achieving sublinear regret against the minimax value.
result First sublinear regret bound for unknown Markov games, independent of action spaces size.
Algorithm estimates Gaussian parameters under unknown truncation sets.
problem Estimating Gaussian parameters when samples are truncated to unknown sets.
method Efficient algorithm for arbitrary unknown truncation sets, using Gaussian surface area as complexity measure.
result Algorithm works for large families of sets including intersections of halfspaces and general convex sets.
New algorithm achieves data-dependent regret bounds in MDPs with unknown transitions.
problem Achieving best-of-both-worlds guarantees with data-dependent regret bounds in MDPs with unknown transitions.
method Optimistic follow-the-regularized-leader algorithm with new optimistic Q-function estimators and transition bonus.
result First-order, second-order, and path-length bounds with polylog(T) regret in the stochastic regime.
New algorithm reduces online learning error for unknown feature distributions.
problem Oracle-efficient hybrid online learning with unknown feature and label distributions.
method Computational efficient online predictor using ERM oracle for finite-VC and fat-shattering classes.
result Oracle-efficient sublinear regret bounds for hybrid online learning with unknown feature generation.
This paper introduces the first asymptotically optimal strategy for a multi armed bandit (MAB) model under side constraints. The side constraints model situations in which bandit activations are limited by the availability of certain resources that are replenished at a constant rate. The main result involves the deriva…
OpenViewer tackles multi-view learning challenges with interpretability and generalization.
problem Lack of interpretability and insufficient generalization in multi-view learning models.
method OpenViewer introduces a Pseudo-Unknown Sample Generation Mechanism, Expression-Enhanced Deep Unfolding Network, and Perception-Augmented Open-Set Training Regime.
result OpenViewer effectively addresses openness challenges and enhances recognition performance for both known and unknown samples.
The paper analyzes sparse high-dimensional linear regression with random design and unknown error variance, providing adaptiveness and concentration rates.
problem Sparse high-dimensional linear regression with random design and unknown error variance.
method Analysis of posterior concentration rates, employing techniques to address model misspecification.
result Adaptiveness and concentration rates of the posterior for sparse high-dimensional linear regression.
This paper tackles unknown causal graphs and soft interventions, establishing regret bounds and an efficient algorithm.
problem Designing causal bandit algorithms with unknown causal graphs and stochastic intervention models.
method Establishes novel regret bounds and presents a computationally efficient algorithm for unknown graph and soft interventions.
result Regret bounds for unknown graph and soft interventions, with a universal minimax lower bound.
New method splits unknown covariance Gaussians into independent parts.
problem Splitting multivariate Gaussian data with unknown covariance.
method Developed a general algorithm for decomposing unknown covariance Gaussians.
result Demonstrated decomposition for single multivariate Gaussian with unknown covariance.
Method preserves Hamiltonian structure for unknown systems from noisy data.
problem Reconstructing unknown Hamiltonian systems from trajectory data.
method Directly approximates the unknown Hamiltonian, enforcing conservation.
result Structure-preserving property demonstrated and effective in numerical examples.
Consider a noisy linear observation model with an unknown permutation, based on observing y = Π ∗ A x ∗ + w y = Π^* A x^* + w y = Π ∗ A x ∗ + w , where x ∗ ∈ R d x^* \in \mathbb{R}^d x ∗ ∈ R d is an unknown vector, Π ∗ Π^* Π ∗ is an unknown n × n n \times n n × n permutation matrix, and w ∈ R n w \in \mathbb{R}^n w ∈ R n is additive Gaussian noise. We analyze the problem of permutation recovery in a …
MetaCaDI learns causal graphs and unknown interventions from few data instances.
problem Discovering causal mechanisms in systems with high data costs and unknown interventions.
method MetaCaDI is a Bayesian meta-learning framework that optimizes for rapid adaptation to new intervention targets.
result MetaCaDI significantly outperforms state-of-the-art methods in causal graph recovery and intervention target prediction.
GP-MRO discovers robust mixed strategies for unknown objectives.
problem Optimizing unknown objectives against worst-case uncertain parameters.
method Sequential learning from noisy point evaluations, combining online learning and Gaussian processes.
result GP-MRO finds robust mixed strategies that significantly improve performance over deterministic strategies.