Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"logarithmic loss"”.

  1. On the Asymptotic Rate-Distortion Function of Multiterminal Source Coding Under Logarithmic Loss

    We consider the asymptotic minimum rate under the logarithmic loss distortion constraint. More specifically, we find the asymptotic minimum rate expression when given distortions get close to 0. The problem under consideration is separate encoding and joint decoding of correlated two information …

    mcmaster Repository record for On the Asymptotic Rate-Distortion Function of Multiterminal Source Coding Under Logarithmic Loss (opens in a new tab)

  2. Applying Machine Learning to Explore Nutrients Predictive of Cardiovascular Disease Using Canadian Linked Population-Based Data

    … x 10-4 – 0.035). The best-performing model had a logarithmic loss of 0.248. Overall, many non-linear relationships were observed, including threshold, j-shaped, and u-shaped. The results of this exploratory study suggest that applying machine learning to the nutritional epidemiology of CVD, …

    mcmaster Repository record for Applying Machine Learning to Explore Nutrients Predictive of Cardiovascular Disease Using Canadian Linked Population-Based Data (opens in a new tab)

  3. Machine Learning Perspectives in Compression, Distributed Computing, and Brain Imaging

    … Coupling with Bottleneck (MEC-B) framework for lossy compression under logarithmic loss. This framework extends the classical Minimum Entropy Coupling (MEC) by incorporating rate limits, enabling a more controlled and flexible approach to compression. We explore the Entropy-Bounded Information …

    toronto-retro Repository record for Machine Learning Perspectives in Compression, Distributed Computing, and Brain Imaging (opens in a new tab)

  4. Hyperparameters, tuning and meta-learning for random forest and other machine learning algorithms

    … For other measures such as the Brier score, the logarithmic loss or the mean squared error, we show that this cannot happen. In a benchmark study based on 306 classification and regression datasets, we illustrate the extent of this unexpected behaviour. We observe that, on average, most of the …

    lmu-germany Repository record for Hyperparameters, tuning and meta-learning for random forest and other machine learning algorithms (opens in a new tab)

  5. Learning from expert advice framework: Algorithms and applications

    … and apply policy iteration to solve it. For the logarithmic loss, we prove that the optimal strategy for the adversary is the greedy policy, whereas for the absolute loss, in the $2$-experts, discounted cost setting, we prove that the optimal strategy is a threshold policy. We extend the results …

    uiuc Repository record for Learning from expert advice framework: Algorithms and applications (opens in a new tab)