paper-with-me

Papers

Kernel Risk-Sensitive Loss: Definition, Properties and Application to Robust Adaptive Filtering

2016-08-01 · Badong Chen, Lei Xing, Bin Xu, Haiquan Zhao, Nanning Zheng, Jose C. Principe

Nonlinear similarity measures defined in kernel space, such as correntropy, can extract higher-order statistics of data and offer potentially significant performance improvement over their linear counterparts especially in non-Gaussian signal processing and machine learning. In this work, we propose a new similarity measure in kernel space, called the kernel risk-sensitive loss (KRSL), and provide some important properties. We apply the KRSL to adaptive filtering and investigate the robustness, and then develop the MKRSL algorithm and analyze the mean square convergence performance. Compared with correntropy, the KRSL can offer a more efficient performance surface, thereby enabling a gradient based method to achieve faster convergence speed and higher accuracy while still maintaining the robustness to outliers. Theoretical analysis results and superior performance of the new algorithm are confirmed by simulation.

📄 PDF Abstract BibTeX arXiv:1608.00441

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

A Generalized Kernel Risk Sensitive Loss for Robust Two-Dimensional Singular Value Decomposition

2020-05-10 · Miaohua Zhang, Yongsheng Gao

Two-dimensional singular decomposition (2DSVD) has been widely used for image processing tasks, such as image reconstruction, classification, and clustering. However, traditional 2DSVD algorithm is based on the mean squa…

ClusteringImage Reconstruction

Fairness risk measures

2019-01-24 · Robert C. Williamson, Aditya Krishna Menon

Ensuring that classifiers are non-discriminatory or fair with respect to a sensitive feature (e.g., race or gender) is a topical problem. Progress in this task requires fixing a definition of fairness, and there have bee…

Fairness

Learning Bounds for Risk-sensitive Learning

2020-06-15 · NeurIPS 2020 12 · Jaeho Lee, Sejun Park, Jinwoo Shin

In risk-sensitive learning, one aims to find a hypothesis that minimizes a risk-averse (or risk-seeking) measure of loss, instead of the standard expected loss. In this paper, we propose to study the generalization prope…

Global Gauge Symmetries, Risk-Free Portfolios, and the Risk-Free Rate

2016-05-11

We define risk-free portfolios using three gauge invariant differential operators that require such portfolios to be insensitive to price changes, to be self-financing, and to produce a zero real return so there are no r…

Risk-Sensitive Reinforcement Learning with Exponential Criteria

2022-12-18 · Erfaun Noorani, Christos Mavridis, John Baras

While reinforcement learning has shown experimental success in a number of applications, it is known to be sensitive to noise and perturbations in the parameters of the system, leading to high variance in the total rewar…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)