paper-with-me

Papers

Penalizing small errors using an Adaptive Logarithmic Loss

2019-10-22 · Chaitanya Kaul, Nick Pears, Hang Dai, Roderick Murray-Smith, Suresh Manandhar

Loss functions are error metrics that quantify the difference between a prediction and its corresponding ground truth. Fundamentally, they define a functional landscape for traversal by gradient descent. Although numerous loss functions have been proposed to date in order to handle various machine learning problems, little attention has been given to enhancing these functions to better traverse the loss landscape. In this paper, we simultaneously and significantly mitigate two prominent problems in medical image segmentation namely: i) class imbalance between foreground and background pixels and ii) poor loss function convergence. To this end, we propose an adaptive logarithmic loss function. We compare this loss function with the existing state-of-the-art on the ISIC 2018 dataset, the nuclei segmentation dataset as well as the DRIVE retinal vessel segmentation dataset. We measure the performance of our methodology on benchmark metrics and demonstrate state-of-the-art performance. More generally, we show that our system can be used as a framework for better training of deep neural networks.

📄 PDF Abstract BibTeX arXiv:1910.09717

Code (0)

등록된 구현이 없습니다.

Tasks

Image SegmentationMedical Image SegmentationRetinal Vessel SegmentationSegmentationSemantic Segmentation

Similar Papers 제목 키워드 기반

Adaptive Minimax Regret against Smooth Logarithmic Losses over High-Dimensional $\ell_1$-Balls via Envelope Complexity

2018-10-09 · Kohei Miyaguchi, Kenji Yamanishi

We develop a new theoretical framework, the \emph{envelope complexity}, to analyze the minimax regret with logarithmic loss functions and derive a Bayesian predictor that adaptively achieves the minimax regret over high-…

Mirror Descent Meets Fixed Share (and feels no regret)

2012-12-01 · NeurIPS 2012 12 · Nicolò Cesa-Bianchi, Pierre Gaillard, Gabor Lugosi, Gilles Stoltz

Mirror descent with an entropic regularizer is known to achieve shifting regret bounds that are logarithmic in the dimension. This is done using either a carefully designed projection or by a weight sharing technique. Vi…

Fine-grained Classification of Solder Joints with α-skew Jensen-Shannon Divergence

2022-09-20 · Furkan Ulger, Seniha Esen Yuksel, Atila Yilmaz, Dincer Gokcen

Solder joint inspection (SJI) is a critical process in the production of printed circuit boards (PCB). Detection of solder errors during SJI is quite challenging as the solder joints have very small sizes and can take va…

ClassificationFine-Grained Image Classificationimage-classificationImage Classification

Boosting Infrared Small Target Detection via Logit-Domain Contrast and Adaptive Shape Refinement

2026-07-02 · Handong Zeng, Zhengeng Yang, Shuai Zhang, Shikai Chen 외 arxiv

Infrared small target detection (IRSTD) remains challenging due to tiny target size, low signal-to-noise ratio, severe foreground-background imbalance, and blurred boundaries in complex scenes. Existing methods usually r…

Damped Online Newton Step for Portfolio Selection

2022-02-15 · Zakaria Mhammedi, Alexander Rakhlin

We revisit the classic online portfolio selection problem, where at each round a learner selects a distribution over a set of portfolios to allocate its wealth. It is known that for this problem a logarithmic regret with…