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.
Paper tackles open set domain adaptation by detecting unknown classes.
New method tackles unknown unknowns in machine learning.
RTSCV detects unknown unknowns to improve model performance.
This research generates synthetic data streams for handling concept drifts and novel classes.
Optimal nonparametric regression estimator adapts to unknown smoothness.
CILF learns adaptive embeddings for class-incremental learning with novel class detection and model update.
Proposes a new framework for open set recognition using conditional probabilistic generative models.
Paper proposes a loss extension for neural networks to improve OSR performance.
A-kNN improves kNN's ability to classify unknown instances.
We investigate the problem of classification in the presence of unknown class-conditional label noise in which the labels observed by the learner have been corrupted with some unknown class dependent probability. In order to obtain finite sample rates, previous approaches to classification with unknown class-conditiona…
Often, when dealing with real-world recognition problems, we do not need, and often cannot have, knowledge of the entire set of possible classes that might appear during operational testing. In such cases, we need to think of robust classification methods able to deal with the "unknown" and properly reject samples belo…
Study online control of unknown time-varying systems with negative and positive results.
New algorithm reduces online learning error for unknown feature distributions.
Survey on deep learning for malware classification, including unknown threats.
New method infers causal effects without knowing control variables.
Classification tasks usually assume that all possible classes are present during the training phase. This is restrictive if the algorithm is used over a long time and possibly encounters samples from unknown classes. The recently introduced extreme value machine, a classifier motivated by extreme value theory, addresse…
As we enter into the big data age and an avalanche of images have become readily available, recognition systems face the need to move from close, lab settings where the number of classes and training data are fixed, to dynamic scenarios where the number of categories to be recognized grows continuously over time, as we…
GMVAE improves open-set classification by clustering latent representations.
The article presents a method that improves the quality of classification of objects described by a combination of known and unknown features. The method is based on modernized Informational Neurobayesian Approach with consideration of unknown features. The proposed method was developed and trained on 1500 text queries…
Although deep neural network (DNN) has achieved many state-of-the-art results, estimating the uncertainty presented in the DNN model and the data is a challenging task. Problems related to uncertainty such as classifying unknown classes (class which does not appear in the training data) data as known class with high co…
Algorithm minimizes regret while adhering to unknown safety constraints.
We consider partially observed multiscale diffusion models that are specified up to an unknown vector parameter. We establish for a very general class of test functions that the filter of the original model converges to a filter of reduced dimension. Then, this result is used to justify statistical estimation for the u…
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 algorithm learns safe policies in unknown environments.
New method learns from noisy data without knowing noise level.
CGDL improves open set recognition by learning conditional Gaussian distributions.
New method identifies latent causal graphs without parametric assumptions.
Model identifies causal structure from paired observational and interventional data with unknown soft interventions.
We develop asymptotically optimal policies for the multi armed bandit (MAB), problem, under a cost constraint. This model is applicable in situations where each sample (or activation) from a population (bandit) incurs a known bandit dependent cost. Successive samples from each population are iid random variables with u…
Study robust learning without knowing perturbation sets, using interactions with attackers.
GnIES recovers causal structure from unknown interventions.
Many applications, including rank aggregation, crowd-labeling, and graphon estimation, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and/or columns. We consider the problem of estimating an unknown matrix in this class, based on noisy observations of (possibly, a su…
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.
Study builds a classifier for diffusions with unknown diffusion but known drifts.
One of the key challenges of performing label prediction over a data stream concerns with the emergence of instances belonging to unobserved class labels over time. Previously, this problem has been addressed by detecting such instances and using them for appropriate classifier adaptation. The fundamental aspect of a n…
Optimal pricing strategy for unknown valuation models with noisy feedback.
A new estimator for evaluating policies in unknown environments.
Anomaly detection is not an easy problem since distribution of anomalous samples is unknown a priori. We explore a novel method that gives a trade-off possibility between one-class and two-class approaches, and leads to a better performance on anomaly detection problems with small or non-representative anomalous sample…
The aim of unsupervised domain adaptation is to leverage the knowledge in a labeled (source) domain to improve a model's learning performance with an unlabeled (target) domain -- the basic strategy being to mitigate the effects of discrepancies between the two distributions. Most existing algorithms can only handle uns…
A method for classifying points with minimal queries using Hermite polynomials.
A new method detects unknown classes and adapts to extra dimensions in high-dimensional classification.
At present, object recognition studies are mostly conducted in a closed lab setting with classes in test phase typically in training phase. However, real-world problem is far more challenging because: i) new classes unseen in the training phase can appear when predicting; ii) discriminative features need to evolve when…
New algorithm POO optimizes noisy, unknown-smooth functions.
Develops a data-driven fault diagnosis framework for time-series data.
In open set recognition (OSR), almost all existing methods are designed specially for recognizing individual instances, even these instances are collectively coming in batch. Recognizers in decision either reject or categorize them to some known class using empirically-set threshold. Thus the decision threshold plays a…
New method improves OSSL by learning from all unlabeled data.
The paper analyzes the statistical cost of tuning kernel hyperparameters in robust regression.
To maximize its success, an AGI typically needs to explore its initially unknown world. Is there an optimal way of doing so? Here we derive an affirmative answer for a broad class of environments.