Post Doctoral researcher
Program in Applied Mathematics
Yale University
edo.liberty@gmail.com
I received my undergraduate degree in Physics and Computer Science from Tel Aviv university
and my Ph.D in Computer Science from Yale University, under the supervision of Steven Zucker.
My research focuses on data mining related algorithms, theory, and applications.
In Particular: fast dimensionality reduction, clustering,
kernel methods and numerical linear algebra. I am also interested in the concentration of measure phenomenon and other
tools for designing randomized algorithms.
Correlation Clustering Revisited: The ``True'' Cost of Error Minimization Problems,
Nir Ailon,
Edo Liberty
International Colloquium on Automata, Languages and Programming (ICALP) 2009
Dense Fast Random Projections and Lean Walsh Transforms,
Edo Liberty, Nir Ailon, Amit Singer
RANDOM 2008.
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes,
Nir Ailon, Edo Liberty
Symposium on Discrete Algorithms (SODA) 2008.
Fast Random Projections,
Mathematics of Knowledge and Search Engines (IPAM) 2007.
see also lecture notes.
Scoring Psychological Questionnaires using
Geometric Harmonics,
Social Data Mining and Knowledge Building (IPAM) 2007.
Scoring Psychological Questionnaires using Geometric Harmonics,
Edo Liberty, Moshe Almagor, Steven Zucker, Yosi Keller, and Ronald Coifman
Snowbird Learning workshop 2007.
A fast randomized algorithm for the approximation of matrices
Edo Liberty, Franco Woolfe, Vladimir Rokhlin,
and Mark Tygert
Applied and Computational Harmonic Analysis (ACHA) 2008.
Randomized algorithms for the low-rank approximation of matrices,
Edo Liberty, Franco Woolfe, Per-Gunnar Martinsson, Vladimir Rokhlin,
and Mark Tygert.
Proceedings of the National Academy of Sciences (PNAS) 2007.
Electrons and Phonons on the Square Fibonacci Tiling
Roni Ilan,
Edo Liberty,
Shahar Even-Dar Mandel,
and Ron Lifshitz.
Ferroelectrics 2004.
Methods for filtering data and filling in missing data using nonlinear inference
Edo Liberty, Steven Zucker, Yosi Keller, Mauro M. Maggioni, Ronald R. Coifman,
Frank Geshwind,
in collaboration with Plain Sight Systems.
(US PATENT # 20070214133 2007)
Method And System For Clustering Data Points
Nir Ailon, Edo Liberty, and Hari Khalsa
Patent issued by Google Inc Ref. No.: GP-1932-00-US QuickCluster
Accelerated Dense Random Projections
PhD Thesis. See also Talk slides
The Mailman algorithm: a note on matrix vector multiplication,
Edo Liberty, Steven Zucker
(Yale university technical report #1402).
Fast Random Projections using Lean Walsh Transforms,
Edo Liberty, Nir Ailon, Amit Singer
(Yale university technical report #1390)
A fast randomized algorithm for approximation of matrices,
Franco Woolfe, Edo Liberty, Vladimir Rokhlin,
and Mark Tygert
(Yale University Technical report #1380)
Random projection method,
Chosen chapters from DIMACS vol.65 by Santosh S. Vempala 2007.
(Inner departmental area exam 2006, see also lecture notes.
Learning functions on graphs and manifolds;
Application to Psychological testing,
(Inner departmental OGST 2006).