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.
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.
The paper improves uncertainty estimation for unknown classes in BNNs.
problem Uncertainty estimation challenges, especially for unknown classes.
method Introducing semi-supervised set classification to improve BNNs.
result Empirical improvement on three datasets: MNIST, notMNIST, and FMNIST.
OSSVM extends SVM for open-set recognition, ensuring proper unknown class rejection.
problem Dealing with unknown classes in real-world recognition problems.
method Introducing OSSVM, balancing empirical and unknown risks.
result Ensures bounded region for known classes, finite risk of unknown.
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%.
This research generates synthetic data streams for handling concept drifts and novel classes.
problem Handling concept drifts and novel classes in dynamic data streams.
method Synthetic data stream generation for both concept drifts and novel classes.
result Demonstrates the effectiveness of unsupervised drift detectors in open set recognition.
New classifiers tackle unknown classes with extreme value theory.
problem Classifiers struggle with unknown classes having different geometries.
method Proposes two new classifiers based on extreme value theory approximations.
result New classifiers outperform existing methods in simulations and real datasets.
Optimal nonparametric regression estimator adapts to unknown smoothness.
problem Nonparametric regression with unknown smoothness.
method Constructs an interpolating estimator that adapts to unknown smoothness.
result Minimax optimal rates achieved on Hölder classes.
CILF learns adaptive embeddings for class-incremental learning with novel class detection and model update.
problem Handling unknown classes and model update in streaming data with new classes.
method CILF uses decoupled prototype based loss for intra-class and inter-class structure improvement, and a learnable curriculum clustering operator for adaptive embedding.
result CILF effectively detects multiple novel classes and mitigates embedding confusion, while updating the model without catastrophic forgetting.
Study investigates classification with unknown label noise in non-compact feature spaces.
problem Classification in the presence of unknown class-conditional label noise in non-compact feature spaces.
method Determines minimax optimal learning rates and presents an adaptive algorithm for classification.
result Optimal learning rates differ from those without label noise, displaying interesting threshold behavior.
Proposes a new framework for open set recognition using conditional probabilistic generative models.
problem Unknown samples can mislead traditional deep neural networks during testing.
method Conditional Probabilistic Generative Models (CPGM) that combine generative models with discriminative information.
result Significantly outperforms baselines on multiple benchmark datasets.
Paper proposes a loss extension for neural networks to improve OSR performance.
problem Open set recognition problem, distinguishing known and unknown classes.
method Introduces a loss function extension to find more discriminative polar representations.
result Significantly improves performance on datasets from different domains.
A-kNN improves kNN's ability to classify unknown instances.
problem kNN's inability to predict unknown instances.
method Developed Advanced kNN (A-kNN) algorithm.
result A-kNN significantly improves accuracy in classifying unknown instances.
Study online control of unknown time-varying systems with negative and positive results.
problem Online control of time-varying systems with unknown dynamics.
method Algorithmic upper bounds and lower bounds for different policy classes.
result Sublinear adaptive regret bounds for Disturbance Response policies.
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.
Survey on deep learning for malware classification, including unknown threats.
problem Classifying and recognizing unknown malware variants.
method Review of deep learning techniques and OSR solutions.
result Deep learning can effectively classify known malware and recognize unknown threats.
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.
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.
Polynomial-time algorithms improve on isotonic matrix estimation with unknown permutations.
problem Estimating a bivariate isotonic matrix with unknown permutations from noisy observations.
method Design and analysis of polynomial-time algorithms.
result Minimax optimal, computationally efficient estimation achievable in certain settings.
GMVAE improves open-set classification by clustering latent representations.
problem Improving open-set classification accuracy and robustness.
method Cooperative learning of reconstruction and clustering in the latent space of a GMVAE.
result Achieved an average F1 improvement of 29.5% in open-set classification.
Paper tackles dynamic open world recognition in online settings.
problem Dynamic open world recognition in online settings.
method Incremental learning of the underlying metric, incremental estimate of confidence thresholds, local learning.
result Proposed methods outperform non-online counterparts in various scenarios.
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. We study statistical detection of grayscale objects in noisy images. The object of interest is of unknown shape and has an unknown intensity, that can be varying over the object and can be negative. No boundary shape constraints are imposed on the object, only a weak bulk condition for the object's interior is required…
New method learns from noisy data without knowing noise level.
problem Learning from noisy data without knowing noise level.
method Uses Stein's Unbiased Risk Estimate (SURE) without noise level knowledge.
result Outperforms other self-supervised methods on imaging problems.
New algorithm learns safe policies in unknown environments.
problem Learning safe policies in unknown, potentially unsafe environments.
method C-UCRL: Upper Confidence Reinforcement Learning for constrained MDPs.
result Achieves sub-linear regret while satisfying constraints.
CGDL improves open set recognition by learning conditional Gaussian distributions.
problem Handling unknown samples in real-world recognition tasks.
method Conditional Gaussian Distribution Learning (CGDL) with probabilistic ladder architecture.
result CGDL significantly outperforms baseline methods on standard image datasets.
Model identifies causal structure from paired observational and interventional data with unknown soft interventions.
problem Identifying causal structure from observational and interventional data with unknown soft interventions.
method Proposes a scalable causal discovery model that aggregates subset-level PDAGs and applies contrastive cross-regime orientation rules.
result The model asymptotically recovers the identifiable PDAG and can orient additional edges compared to non-contrastive subset-restricted methods.
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.
Study robust learning without knowing perturbation sets, using interactions with attackers.
problem Learning robust predictors against unknown adversarial perturbations.
method Examined different interaction models with adversarial attackers, derived bounds on sample complexity and interactions.
result Upper bounds on sample complexity and lower bounds on interactions in various models.
GnIES recovers causal structure from unknown interventions.
problem Recovering causal structure from unknown interventions.
method Characterization of equivalence classes, greedy learning algorithm GnIES.
result GnIES recovers the equivalence class of the data-generating model.
Study builds a classifier for diffusions with unknown diffusion but known drifts.
problem Multiclass classification of S.D.E. paths with unknown diffusion coefficient.
method Plug-in classifier using nonparametric estimators of drift and diffusion functions.
result Consistent classification procedure with rate of convergence under different assumptions.
We prove the existence of Sasaki-Einstein metrics on certain simply connected 5-manifolds where until now existence was unknown. All of these manifolds have non-trivial torsion classes. On several of these we show that there are a countable infinity of deformation classes of Sasaki-Einstein structures.
The study develops a test for GARCH models with unknown power.
problem Testing adequacy of asymmetric power GARCH models with unknown power.
method Derive asymptotic behavior of squared residuals autocovariances, deduce portmanteau test.
result Asymptotic results and adequacy test for GARCH models with unknown power.
Optimal pricing strategy for unknown valuation models with noisy feedback.
problem Minimizing regret in dynamic pricing with unknown valuation functions and noisy feedback.
method Proposes a minimax-optimal algorithm using discretization and data partitioning to handle unknown noise distribution and Lipschitz continuity of valuation functions.
result Achieves minimax-optimal regret bound matching the theoretical lower bound up to logarithmic factors.
A new estimator for evaluating policies in unknown environments.
problem Evaluating policies when both logging policy and value function are unknown.
method Doubly-Robust (DR) off-policy evaluation (OPE) estimator, DRUnknown, that estimates both the logging policy and value function.
result DRUnknown achieves the smallest asymptotic variance and is optimal when both models are correctly specified.
Reduced model helps estimate parameters from partially observed multiscale data.
problem Estimating parameters from high-dimensional partially observed multiscale data.
method Established convergence of filter from high-dimensional to reduced dimension model.
result Statistical estimation of parameters is possible in lower dimensions.
New approach uses class domains for classification when distributions are unknown.
problem Traditional classification rules are inadequate when class distributions are ill-defined or unknown.
method Use class domains instead of class distributions for constructing a reliable decision function.
result Illustrated examples show the effectiveness of the new approach.
Optimal policies for MAB with cost constraint developed.
problem Maximizing outcomes in multi-armed bandit with cost constraint.
method Developed asymptotically optimal policies for MAB under cost constraint.
result Constructed feasible uniformly fast (f-UF) convergent policies achieving asymptotic lower bound on regret.
A method for classifying points with minimal queries using Hermite polynomials.
problem Classifying points from an unknown probability measure with minimal label queries.
method Convex combination of conditional probabilities, Hermite polynomial kernel for hierarchical support estimation.
result The method achieves high F F F -score for classification in hyper-spectral images and MNIST. A new method detects unknown classes and adapts to extra dimensions in high-dimensional classification.
problem Handling unknown classes and extra variables in high-dimensional classification.
method Dimension-Adaptive Mixture Discriminant Analysis (D-AMDA) using an EM algorithm for model estimation.
result The method can adapt to unknown classes and extra dimensions in high-dimensional data.
A new framework detects novel classes in data streams.
problem Detecting novel class labels in data streams.
method Semi-supervised multi-task learning framework for co-representation learning.
result Superior performance over existing methods on real-world datasets.
Develops a data-driven fault diagnosis framework for time-series data.
problem Fault diagnosis of dynamic systems using imbalanced and unknown fault classes.
method Kullback-Leibler divergence, data-driven fault classification, open-set classification.
result Framework handles imbalanced datasets, class overlapping, and unknown faults.
New algorithm POO optimizes noisy, unknown-smooth functions.
problem Optimizing functions with unknown smoothness and noisy evaluations.
method Adaptive optimization algorithm POO.
result POO performs nearly as well as known algorithms with smoothness knowledge, and works for broader classes of functions.
Estimates model parameters from noisy, quantized data with unknown nonlinear relationship.
problem Estimating model parameters from noisy, quantized data with unknown nonlinear relationship.
method Spectral-based estimation procedure for high-dimensional sparse settings.
result Optimal recovery of model parameters in settings where previous algorithms fail.
New method improves OSSL by learning from all unlabeled data.
problem Handling open-set semi-supervised learning with unknown classes.
method Self-supervision and energy-based score for all unlabeled data.
result State-of-the-art results on benchmark problems.
The paper analyzes the statistical cost of tuning kernel hyperparameters in robust regression.
problem Finding the best interpolant from a class of kernels with unknown hyperparameters under adversarial noise.
method Finite-sample guarantees, subsampling guarantee for linear regression, ε-net argument for discretizing kernel parameterizations.
result Hyperparameter optimization increases sample complexity by just a logarithmic factor, compared to known parameters.
End-to-end framework learns new classes dynamically.
problem Challenges in recognizing unseen classes in real-world settings.
method Dynamic cascade of classifiers that incrementally learn features.
result Outperforms existing methods on real-world datasets.
Paper proposes a new decision strategy for open set recognition.
problem Existing OSR methods are limited in recognizing unknown classes and setting decision thresholds.
method Introduces a collective decision-based OSR framework (CD-OSR) using Hierarchical Dirichlet process (HDP).
result CD-OSR can simultaneously implement open set recognition and new class discovery.