Subset Sum: LLL AlgorithmCovers the Subset Sum problem and the efficient LLL algorithm for finding solutions in lattice basis reduction.
Learning from Probabilistic ModelsDelves into challenges of learning from probabilistic models, covering computational complexity, data reconstruction, and statistical gaps.
Generalization in Deep LearningDelves into the trade-off between model complexity and risk, generalization bounds, and the dangers of overfitting complex function classes.
Exact methods: Branch and BoundExplores the Branch and Bound algorithm in discrete optimization, efficiently finding optimal solutions by calculating lower bounds on subsets.
Complexity of AlgorithmsExplores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.
