All Topics
All Topics
Technology
Technology
AI
AI
Business
Business
Entertainment
Entertainment
News
News
Programming
Programming
Science
Science
Design
Design
Environment
Environment
Finance
Finance
Crypto
Crypto
Politics
Politics
Sports
Sports
Education
Education
Gaming
Gaming
Art
Art
Music
Music
Health
Health
Security
Security
Books
Books
Food
Food
Travel
Travel
Personal
Personal
Bluesky
Twitter

Allen School professor Thomas Rothvoss earns inaugural Trevisan Prize for advancing the study of optimization problems

By

Kristine White

4mo agoen

Source

news.cs.washington.eduAllen School professor Thomas Rothvoss earns inaugural Trevisan Prize for advancing the study of optimization problemswashington.edu
Snippet from the RSS feed
Allen School professor Thomas Rothvoss has carved a career out of complexity. As a member of the school’s Theory of Computation Group , Rothvoss examines the theoretical limits of computer algorithms that are designed to analyze large, complex datasets. His aim is to settle long-standing problems in the field of combinatorial optimization — an area where he has made notable progress since his arrival at the University of Washington in 2014. Last month, Rothvoss collected the inaugural Trevisan Prize in the mid-career category for his breakthrough contributions in the study of optimization problems. Read more →

You might also wanna read

Reflecting on Optimisation: A Personal Take on Theory vs. Modern Practice

Magnus Ross reflects on his lack of deep study in optimisation, admitting he knows the basics (Adam, AdaGrad, L-BFGS) but zones out when dis

magnusross.github.io·11d ago

How Optimization Became a Social Philosophy — and What It Costs Us

This article explores how optimization — originally a mathematical tool for solving logistical problems — has evolved into a pervasive socia

theideasletter.org·3d ago

Quantum Divide-and-Conquer TSP Solver Achieves Improved Exponential Base Over Classical Held-Karp Algorithm

This paper presents a quantum divide-and-conquer approach to the traveling salesman problem (TSP), a classic NP-hard optimization problem. T

arxiv.org·1mo ago

The Mathematical Foundations of Expander Graphs for Optimal Routing Networks

This article explores the mathematical foundations of optimal routing networks, tracing back to the late 1970s with the study of "expander"

perspectives.mvdirona.com·27d ago

How AI is reshaping mathematics: Terence Tao on the coming era of human-machine collaboration

Terence Tao of UCLA argues that AI could usher in an era of "Big Mathematics," where humans and machines collaborate on complex problems. Th

spectrum.ieee.org·11d ago

How AI is reshaping mathematics: Terence Tao on the coming era of human-machine collaboration

Terence Tao of UCLA argues that AI could usher in an era of "Big Mathematics," where humans and machines collaborate on complex problems. Th

spectrum.ieee.org·11d ago

How AI is reshaping mathematics: Terence Tao on the coming era of human-machine collaboration

Terence Tao of UCLA argues that AI could usher in an era of "Big Mathematics," where humans and machines collaborate on complex problems. Th

IEEE·11d ago

Researchers Establish Riemannian Geometry Framework for Tensor Network Optimization

Researchers at the Complutense University of Madrid, led by Pablo Páez-Velasco, have established a Riemannian manifold structure for tensor

iq.fp2.dev·12d ago

Comments

Sign in to join the conversation.

No comments yet. Be the first.