scholarly journals Mathematical Analysis on Information-Theoretic Metric Learning With Application to Supervised Learning

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 121998-122005
Author(s):  
Jooyeon Choi ◽  
Chohong Min ◽  
Byungjoon Lee
Author(s):  
Greg Ver Steeg

Learning by children and animals occurs effortlessly and largely without obvious supervision. Successes in automating supervised learning have not translated to the more ambiguous realm of unsupervised learning where goals and labels are not provided. Barlow (1961) suggested that the signal that brains leverage for unsupervised learning is dependence, or redundancy, in the sensory environment. Dependence can be characterized using the information-theoretic multivariate mutual information measure called total correlation. The principle of Total Cor-relation Ex-planation (CorEx) is to learn representations of data that "explain" as much dependence in the data as possible. We review some manifestations of this principle along with successes in unsupervised learning problems across diverse domains including human behavior, biology, and language.


Author(s):  
Jason V. Davis ◽  
Brian Kulis ◽  
Prateek Jain ◽  
Suvrit Sra ◽  
Inderjit S. Dhillon

2018 ◽  
Vol 10 (9) ◽  
pp. 1415 ◽  
Author(s):  
Yanni Dong ◽  
Bo Du ◽  
Liangpei Zhang ◽  
Xiangyun Hu

By using the high spectral resolution, hyperspectral images (HSIs) provide significant information for target detection, which is of great interest in HSI processing. However, most classical target detection methods may only perform well based on certain assumptions. Simultaneously, using limited numbers of target samples and preserving the discriminative information is also a challenging problem in hyperspectral target detection. To overcome these shortcomings, this paper proposes a novel adaptive information-theoretic metric learning with local constraints (ITML-ALC) for hyperspectral target detection. The proposed method firstly uses the information-theoretic metric learning (ITML) method as the objective function for learning a Mahalanobis distance to separate similar and dissimilar point-pairs without certain assumptions, needing fewer adjusted parameters. Then, adaptively local constraints are applied to shrink the distances between samples of similar pairs and expand the distances between samples of dissimilar pairs. Finally, target detection decision can be made by considering both the threshold and the changes between the distances before and after metric learning. Experimental results demonstrate that the proposed method can obviously separate target samples from background ones and outperform both the state-of-the-art target detection algorithms and the other classical metric learning methods.


2010 ◽  
Vol 2010 ◽  
pp. 1-19
Author(s):  
Konstantinos Drakakis

In the game of Betweenies, the player is dealt two cards out of a deck and bets on the probability that the third card to be dealt will have a numerical value in between the values of the first two cards. In this work, we present the exact rules of the two main versions of the game, and we study the optimal betting strategies. After discussing the shortcomings of the direct approach, we introduce an information-theoretic technique, Kelly's criterion, which basically maximizes the expected log-return of the bet: we offer an overview, discuss feasibility issues, and analyze the strategies it suggests. We also provide some gameplay simulations.


Sign in / Sign up

Export Citation Format

Share Document