paper-with-me

홈 › Papers

Unsupervised Learning of the Set of Local Maxima

2020-01-14 · ICLR 2019 5 · Lior Wolf, Sagie Benaim, Tomer Galanti

This paper describes a new form of unsupervised learning, whose input is a set of unlabeled points that are assumed to be local maxima of an unknown value function v in an unknown subset of the vector space. Two functions are learned: (i) a set indicator c, which is a binary classifier, and (ii) a comparator function h that given two nearby samples, predicts which sample has the higher value of the unknown function v. Loss terms are used to ensure that all training samples x are a local maxima of v, according to h and satisfy c(x)=1. Therefore, c and h provide training signals to each other: a point x' in the vicinity of x satisfies c(x)=-1 or is deemed by h to be lower in value than x. We present an algorithm, show an example where it is more efficient to use local maxima as an indicator function than to employ conventional classification, and derive a suitable generalization bound. Our experiments show that the method is able to outperform one-class classification algorithms in the task of anomaly detection and also provide an additional signal that is extracted in a completely unsupervised way.

📄 PDF Abstract BibTeX arXiv:2001.05026

Code (0)

등록된 구현이 없습니다.

Tasks

Anomaly DetectionGeneral ClassificationOne-Class Classification

Similar Papers 제목 키워드 기반

(Un)supervised Learning of Maximal Lyapunov Functions

2024-08-30 · Matthieu Barreau, Nicola Bastianello

In this paper, we address the problem of discovering maximal Lyapunov functions, as a means of determining the region of attraction of a dynamical system. To this end, we design a novel neural network architecture, which…

Physics-informed machine learning

Unsupervised Broadcast News Summarization; a comparative study on Maximal Marginal Relevance (MMR) and Latent Semantic Analysis (LSA)

2023-01-05 · Majid Ramezani, Mohammad-Salar Shahryari, Amir-Reza Feizi-Derakhshi, Mohammad-Reza Feizi-Derakhshi

The methods of automatic speech summarization are classified into two groups: supervised and unsupervised methods. Supervised methods are based on a set of features, while unsupervised methods perform summarization based…

News Summarization

Implicit field learning for unsupervised anomaly detection in medical images

2021-06-09 · Sergio Naval Marimont, Giacomo Tarroni

We propose a novel unsupervised out-of-distribution detection method for medical images based on implicit fields image representations. In our approach, an auto-decoder feed-forward neural network learns the distribution…

Anomaly DetectionDecoderOut-of-Distribution DetectionUnsupervised Anomaly Detection

Attributed Graph Mining and Matching: An Attempt to Define and Extract Soft Attributed Patterns

2014-06-01 · CVPR 2014 6 · Quanshi Zhang, Xuan Song, Xiaowei Shao, Huijing Zhao 외

Graph matching and graph mining are two typical areas in artificial intelligence. In this paper, we define the soft attributed pattern (SAP) to describe the common subgraph pattern among a set of attributed relational gr…

Graph MatchingGraph Mining

Blind phoneme segmentation with temporal prediction errors

2016-08-01 · ACL 2017 7 · Paul Michel, Okko Räsänen, Roland Thiollière, Emmanuel Dupoux

Phonemic segmentation of speech is a critical step of speech recognition systems. We propose a novel unsupervised algorithm based on sequence prediction models such as Markov chains and recurrent neural network. Our appr…

Predictionspeech-recognitionSpeech Recognition