Calendar of Events
S Sun
M Mon
T Tue
W Wed
T Thu
F Fri
S Sat
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
0 events,
0 events,
0 events,
0 events,
1 event,
LIDS Seminar Series Vijay Balasubramanian
The Maps Inside Your Head
How do our brains make sense of a complex and unpredictable world? In this talk, I will discuss an information theory approach to the neural topography of information processing in the brain. First I will review the brain's architecture, and how neural circuits map out the sensory and cognitive worlds. Then I will describe how…
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
LIDS Seminar Series Alexandre Tsybakov
Regularized Nonlinear Acceleration
We describe a convergence acceleration technique for generic optimization problems. Our scheme computes estimates of the optimum from a nonlinear average of the iterates produced by any optimization method. The weights in this average are computed via a simple linear system, whose solution can be updated online. This acceleration scheme runs in parallel to the…
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
LIDS Seminar Series Noga Alon
Structure, Randomness and Universality
What is the minimum possible number of vertices of a graph that contains every k-vertex graph as an induced subgraph? What is the minimum possible number of edges in a graph that contains every k-vertex graph with maximum degree 3 as a subgraph? These questions and related one were initiated by Rado in the 60s,…
0 events,
0 events,
0 events,
0 events,
LIDS Seminar Series: Stefano Soatto (UCLA)
The Maps Inside Your Head
How do our brains make sense of a complex and unpredictable world? In this talk, I will discuss an information theory approach to the neural topography of information processing in the brain. First I will review the brain's architecture, and how neural circuits map out the sensory and cognitive worlds. Then I will describe how…
Regularized Nonlinear Acceleration
We describe a convergence acceleration technique for generic optimization problems. Our scheme computes estimates of the optimum from a nonlinear average of the iterates produced by any optimization method. The weights in this average are computed via a simple linear system, whose solution can be updated online. This acceleration scheme runs in parallel to the…
Structure, Randomness and Universality
What is the minimum possible number of vertices of a graph that contains every k-vertex graph as an induced subgraph? What is the minimum possible number of edges in a graph that contains every k-vertex graph with maximum degree 3 as a subgraph? These questions and related one were initiated by Rado in the 60s,…
