Search for dissertations about: "Minimax algorithms"

Showing result 1 - 5 of 9 swedish dissertations containing the words Minimax algorithms.

  2. 1. Data driven modeling in the presence of time series structure: : Improved bounds and effective algorithms

    Author : Othmane Mazhar; Boualem Djehiche; Munther Dahleh; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Time series; Non-asymptotic estimation; Minimax; Change point detection; Hidden Markov model; State space model; Least square; Penalized Regression; Random covariance matrix; Concentration inequality; Chaining integral; Self-normalized martingale inequality; Cramér-Rao inequality; van Trees inequality; Matematisk statistik; Mathematical Statistics;

    Abstract : This thesis consists of five appended papers devoted to modeling tasks where the desired models are learned from data sets with an underlying time series structure. We develop a statistical methodology for providing efficient estimators and analyzing their non-asymptotic behavior. READ MORE

  4. 2. Minimax Approaches to Robust Model Predictive Control

    Author : Johan Löfberg; Torkel Glad; Lennart Ljung; Linköpings universitet; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; MPX; Minimax algorithms;

    Abstract : Controlling a system with control and state constraints is one of the most important problems in control theory, but also one of the most challenging. Another important but just as demanding topic is robustness against uncertainties in a controlled system. READ MORE

  5. 3. Low-complexity algorithms in digital receivers

    Author : Ove Edfors; Luleå tekniska universitet; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Signalbehandling; Signal Processing;

    Abstract : This thesis addresses low-complexity algorithms in digital receivers. This includes algorithms for estimation, detection, and source coding. READ MORE

  6. 4. Offline and Online Models for Learning Pairwise Relations in Data

    Author : Fazeleh Sadat Hoseini; Chalmers tekniska högskola; []
    Keywords : 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;

    Abstract : 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. READ MORE

  7. 5. Online Learning for Energy Efficient Navigation in Stochastic Transport Networks

    Author : Niklas Åkerblom; Chalmers tekniska högskola; []
    Keywords : 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;

    Abstract : 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. READ MORE