A Spider Bite Is Worth the Chance Of Becoming Spider-Man...

Tag combinatorial optimization

Mollifying Networks: Taming the Complexity of Deep Neural Network Optimization

Why is the Optimization of Deep Neural Networks Challenging? Deep neural networks (DNNs) have revolutionized the field of artificial intelligence and machine learning, achieving remarkable success in a variety of tasks such as image recognition, natural language processing, and speech… Continue Reading →

Tensor Ring Decomposition: Exploring a Powerful Tool for Optimization

Tensor networks have emerged as powerful tools for solving large-scale optimization problems in recent years. These networks are capable of handling complicated tensor structures and have proven to be highly effective in various fields. One popular tensor network model is… Continue Reading →

Understanding Submodular Functions: from Discrete to Continuous Domains

What are Submodular Set-Functions? Submodular set-functions are mathematical objects that have various applications in combinatorial optimization. These functions can be minimized and approximately maximized in polynomial time, making them valuable tools in solving optimization problems. Real-world example: Imagine you are… Continue Reading →

Newer posts »

© 2026 Christophe Garon — Powered by WordPress

Theme by Anders NorenUp ↑