Sökning: "Online Minimax Path Problem"

Hittade 2 avhandlingar innehållade orden Online Minimax Path Problem.

1. 1. Online Learning for Energy Efficient Navigation in Stochastic Transport Networks

   Författare :Niklas Åkerblom; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Thompson Sampling; Online Minimax Path Problem; Multi-Armed Bandits; Online Learning; Online Shortest Path Problem; Machine Learning; Combinatorial Semi-Bandits; Energy Efficient Navigation;

   Sammanfattning : Reducing the dependence on fossil fuels in the transport sector is crucial to have a realistic chance of halting climate change. The automotive industry is, therefore, transitioning towards an electrified future at an unprecedented pace. LÄS MER

3. 2. Offline and Online Models for Learning Pairwise Relations in Data

   Författare :Fazeleh Sadat Hoseini; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Mulit-Armed Bandit; Pairwise Relations; Performance Modeling; Motion Trajectory Clustering; Minimax Distance; Bottleneck Identification; Online Learning; Representation Learning; Memory Efficiency; Concurrent Programming; Thompson Sampling;

   Sammanfattning : Pairwise relations between data points are essential for numerous machine learning algorithms. Many representation learning methods consider pairwise relations to identify the latent features and patterns in the data. This thesis, investigates learning of pairwise relations from two different perspectives: offline learning and online learning. LÄS MER