English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Supervised learning in neural nets means optimizing synaptic weights  W  such that outputs  y ( x ; W ) for inputs  x  match as closely as possible the corresponding targets  t  from the training data set. This optimization means minimizing a loss function    ${\mathscr{L}}(\mathbf {W})$  L ( W ) that usually motivates from maximum-likelihood principles, silently making some prior assumptions on the distribution of output errors  y  − t . While classical crossentropy loss assumes triangular error distributions, it has recently been shown that generalized power error loss functions can be adapted to more realistic error distributions by fitting the exponent  q  of a power function used for initializing the backpropagation learning algorithm. This approach can significantly improve performance, but computing the loss function requires the antiderivative of the function  f ( y ) :=  y   q − 1 /(1 −  y ) that has previously been determined only for natural    $q\in \mathbb {N}$  q ∈ ℕ . In this work I extend this approach for rational  q  =  n /2  m   where the denominator is a power of 2. I give closed-form expressions for the antiderivative    ${\int \limits } f(y) dy$  ∫ f ( y ) d y and the corresponding loss function. The benefits of such an approach are demonstrated by experiments showing that optimal exponents  q  are often non-natural, and that error exponents  q  best fitting output error distributions vary continuously during learning, typically decreasing from large  q  &gt; 1 to small  q  &lt; 1 during convergence of learning. These results suggest new adaptive learning methods where loss functions could be continuously adapted to output error distributions during learning.

On the antiderivatives of xp/(1 − x) with an application to optimize loss functions for classification with neural networks