Presentation is loading. Please wait.

Presentation is loading. Please wait.

Peter Richtarik Operational Research and Optimization Extreme* Mountain Climbing * in a billion dimensional space on a foggy day.

Published byPreston Daniels Modified over 9 years ago

Similar presentations

Presentation on theme: "Peter Richtarik Operational Research and Optimization Extreme* Mountain Climbing * in a billion dimensional space on a foggy day."— Presentation transcript:

1 Peter Richtarik Operational Research and Optimization Extreme* Mountain Climbing * in a billion dimensional space on a foggy day

2 Western General Hospital ( Creutzfeldt-Jakob Disease) Arup (Truss Topology Design) Ministry of Defence dstl lab (Algorithms for Data Simplicity) Royal Observatory (Optimal Planet Growth)

3 GOD’S Algorithm = Teleportation

4 If you are not a God... x0x0 x1x1 x2x2 x3x3

5 4-Dial Lock F : {0,1,...,9} 4 R Combination maximizing F opens the lock

6 BIG DATA

7 How to Open a Lock with Billion Interconnected Dials? F : R 1,000,000,000 R

8 Parallel Coordinate Descent

9 Theory vs Reality

10 Research Paper

11 Algorithms

12 Probability

13 Inequalities

14 Complexity

15 TOOLS Probability Machine LearningMatrix Theory HPC

Download ppt "Peter Richtarik Operational Research and Optimization Extreme* Mountain Climbing * in a billion dimensional space on a foggy day."

Similar presentations

Peter Richtárik Parallel coordinate Simons Institute for the Theory of Computing, Berkeley Parallel and Distributed Algorithms for Inference and Optimization,

Peter Richtárik Parallel coordinate Simons Institute for the Theory of Computing, Berkeley Parallel and Distributed Algorithms for Inference and Optimization,
Max output (Q) subject to a cost constraint

Max output (Q) subject to a cost constraint
1 © 2006 by Nelson, a division of Thomson Canada Limited Slides developed by: William Rentz & Al Kahl University of Ottawa Web Appendix 4A Production Decisions.

1 © 2006 by Nelson, a division of Thomson Canada Limited Slides developed by: William Rentz & Al Kahl University of Ottawa Web Appendix 4A Production Decisions.
Slide 1 EE3J2 Data Mining EE3J2 Data Mining Lecture 11: K-Means Clustering Martin Russell.

Slide 1 EE3J2 Data Mining EE3J2 Data Mining Lecture 11: K-Means Clustering Martin Russell.
© 2013 IBM Corporation Complexity must be conquered (Data is more than “just” big) Laura Haas IBM Almaden Research Center 1.

© 2013 IBM Corporation Complexity must be conquered (Data is more than “just” big) Laura Haas IBM Almaden Research Center 1.
Peter Richtarik Why parallelizing like crazy and being lazy can be good.

Peter Richtarik Why parallelizing like crazy and being lazy can be good.
Parallel Coordinates Representation of multi-dimensional data Discovery Process xmdv Visualization Tool Ganesh K. Panchanathan Christa M. Chewar.

Parallel Coordinates Representation of multi-dimensional data Discovery Process xmdv Visualization Tool Ganesh K. Panchanathan Christa M. Chewar.
Peter Richtárik Distributed Coordinate Descent For Big Data Optimization Numerical Algorithms and Intelligent Software - Edinburgh – December 5, 2014 2.

Peter Richtárik Distributed Coordinate Descent For Big Data Optimization Numerical Algorithms and Intelligent Software - Edinburgh – December 5,
Peter Richtarik School of Mathematics Optimization with Big Data * in a billion dimensional space on a foggy day Extreme* Mountain Climbing =

Peter Richtarik School of Mathematics Optimization with Big Data * in a billion dimensional space on a foggy day Extreme* Mountain Climbing =
Peter Richtárik Parallel coordinate NIPS 2013, Lake Tahoe descent methods.

Peter Richtárik Parallel coordinate NIPS 2013, Lake Tahoe descent methods.
15 March 04 GC2 Systems Thinking Workshop. What is a System? “An interconnected set of elements that is coherently organized around some purpose” -Dana.

15 March 04 GC2 Systems Thinking Workshop. What is a System? “An interconnected set of elements that is coherently organized around some purpose” -Dana.
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.

Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
Support Vector Machines

Support Vector Machines
Lecture 10: Support Vector Machines

Lecture 10: Support Vector Machines
Pattern Recognition. Introduction. Definitions.. Recognition process. Recognition process relates input signal to the stored concepts about the object.

Pattern Recognition. Introduction. Definitions.. Recognition process. Recognition process relates input signal to the stored concepts about the object.
Path Planning of Robot in Three- dimensional Grid Environment based on Genetic Algorithms Hua Zhang, Manlu Liu, Ran Liu, Tianlian Hu Intelligent Control.

Path Planning of Robot in Three- dimensional Grid Environment based on Genetic Algorithms Hua Zhang, Manlu Liu, Ran Liu, Tianlian Hu Intelligent Control.
Peter Richtárik (joint work with Martin Takáč) Distributed Coordinate Descent Method AmpLab All Hands Meeting - Berkeley - October 29, 2013.

Peter Richtárik (joint work with Martin Takáč) Distributed Coordinate Descent Method AmpLab All Hands Meeting - Berkeley - October 29, 2013.

XBRL Update Arthur West, Companies House, GB 247,527 GB accounts filed as XBRL in 2008-9.

XBRL Update Arthur West, Companies House, GB 247,527 GB accounts filed as XBRL in
1 Yang Yang, Jie Tang, Juanzi Li Tsinghua University Walter Luyten, Marie-Francine Moens Katholieke Universiteit Leuven Lu Liu Northwestern University.

1 Yang Yang, Jie Tang, Juanzi Li Tsinghua University Walter Luyten, Marie-Francine Moens Katholieke Universiteit Leuven Lu Liu Northwestern University.

Similar presentations

Ads by Google