X

# Posts

### April 22, 2014

+
Justin Haldar just sent me the following:Hi Igor,Wanted to let you know that we've finally put out the public release of the LORAKS code (that you featured on Nuit Blanche back in December). There is a technical report that describes the implementation and walks through all of the examples included with the code available here:http://sipi.usc.edu/reports/abstracts.php?rid=sipi-414The tech report (and the corresponding demo code) build on the original published LORAKS paper, showing several […]

### April 21, 2014

+
A fortune I recently received: If that tells me anything about my future, I think I want to stay now.
+
I mentioned this paper before but now there is a newer version and most importantly, an implementation.PETRELS: Parallel Subspace Estimation and Tracking by Recursive Least Squares from Partial Observations by Yuejie Chi, Yonina C. Eldar, Robert CalderbankMany real world data sets exhibit an embedding of low-dimensional structure in a high-dimensional manifold. Examples include images, videos and internet traffic data. It is of great significance to reduce the storage requirements and […]
+
New release of Jug: 1.0 release candidate I’ve put out a new release of jug, which I’m calling 1.0-rc0. This is a release candidate for version 1.0 and if there are no bugs, in a few days, I’ll just call it … Continue reading →
+
This year’s Wondercon was another great convention. We met a ton of great makers, saw some incredible prototypes of collectible props in development, and even found some new comics to read. It’s also where we finally unveiled the completed Zoidberg project and costume—more of that in the coming days. But for now, here’s our annual gallery of the great costumes and makeups we saw in the exhibit hall. Hope you enjoy them, and post your favorites in the comments below! […]
+
This year’s Wondercon was another great convention. We met a ton of great makers, saw some incredible prototypes of collectible props in development, and even found some new comics to read. It’s also where we finally unveiled the completed Zoidberg project and costume—more of that in the coming days. But for now, here’s our annual gallery of the great costumes and makeups we saw in the exhibit hall. Hope you enjoy them, and post your favorites in the comments below! […]
+
Euclid’s proof that there are infinitely many primes is simple and ancient. This proof is given early in any course on number theory, and even then most students would have seen it before taking such a course. There are also…Read more ›
+
There are a ton of great apps and games in Google Play, and they're not just going to download themselves. Are they? If they are, we have something of a mystery to solve. In the meantime, let's see what's cooking in the Play Store with the weekly Google Play App Roundup. Just click the links to head right to the Play Store page and check out the apps for yourself.This week we've got a new stock camera app, a game with spider men, and a space shooter with marshmallow men.Google CameraGoogle's […]
+
No summary available for this post.
+
It started in 2009 when John Langford and colleagues noted that label vectors were sparse and that using techniques of compressive sensing one could reduce learning in large dimensional space. Here is a new entrant in this area:Random forests with random projections of the output space for high dimensional multi-label classification by Arnaud Joly, Pierre Geurts, Louis WehenkelWe adapt the idea of random projections applied to the output space, so as to enhance tree-based […]

### April 20, 2014

+
The future of cloud computing is the availability of more computing power at a much lower cost; Moore’s law thus gives way to Bezos’ law: Over the history of cloud, a unit of computing power price is reduced by 50% approximately every three years.   The cost of cloud computing should naturally track Moore’s law […]
+
Figure from [1]In the Advanced Matrix Factorization page, I have no listing for the phase transition section of the spectral clustering or its nonlinear cousin subspace clustering. Little did I know that Suresh Venkatasubramanian (from the GeomBlog fame) has written about it in his essay on clustering. In particular, he wrote this interesting entry entitled: Choosing the number of clusters III: Phase Transitions where he draws a connection with statistical […]
+
Why they can be important Advertising source Joe Bloggs is not a computer scientist, at least not one that we know. As noted by Wikipedia, Joe Bloggs is a “placeholder name” like “John Doe” or “Jane Roe” in the US, or “Ashok Kumar” in India. Sometimes real people have or acquire the placeholder names: Ashok […]
+
A few days ago, the article Boring Systems Build Badass Businesses appeared on Hacker News. In one comment, idlewan wrote, "It's not about the end result, it's about using better tools to get to it," arguing the case for specialized tools, in this case some CSS compiler. In response, mcguire wrote: How old is your CSS compiler? After gaining a fair amount of experience with various technologies over the years (by which I mean, getting burned (especially by things that seem wonderful and then […]

### April 19, 2014

+
Here the monotonicity of the EM algorithm is established. $$f_{o}(Y_{o}|\theta)=f_{o,m}(Y_{o},Y_{m}|\theta)/f_{m|o}(Y_{m}|Y_{o},\theta)$$ $$\log L_{o}(\theta)=\log L_{o,m}(\theta)-\log f_{m|o}(Y_{m}|Y_{o},\theta) \label{eq:loglikelihood}$$ where $$L_{o}(\theta)$$ is the likelihood under the observed data and $$L_{o,m}(\theta)$$ is the likelihood under the complete data. Taking the expectation of the second line with respect to the conditional distribution of $$Y_{m}$$ given $$Y_{o}$$ and […]

Ruslan R Salakhutdinov, Sam T Roweis & Zoubin Ghahramani (2012). On the Convergence of Bound Optimization Algorithms, arXiv, arXiv:

Wu C.F.J. (1983). On the Convergence Properties of the EM Algorithm, The Annals of Statistics, 11 (1) 95-103. DOI:

McLachlan G. & Peel D. DOI:

Citation
+
Found Turing’s plaque today near King’s College, Cambridge (his alma mater).Filed under: Computer science, Mathematics
+
No summary available for this post.
+
The folks at ICLR 2014 are releasing videos of the meeting. The whole channel of the meeting is here. Here is a sampling of interest with attendant reviews and papers: ICLR 2014 Talk: "Revisiting Natural Gradient for Deep Networks" by Razvan Pascanu and Yoshua Bengio.Attendant review of the paper.    ICLR 2014 Talk: "Exact solutions to the nonlinear dynamics of learning in deep linear neural networks" by Andrew M. Saxe, James L. McClelland, Surya Ganguli Attendant […]
+
Dans le quiz sur les poissons (d'avril ou pas), une majorité des participants a répondu "vrai" à la question 6: "Les requins sont attirés par une goutte de sang humain à des kilomètres". Or la réponse, ou plutôt ma réponse puisque … Lire la suite →
+
Learning Visual Representations at Scale by Vincent Vanhoucke (another presentation that features Deep ConvNets; "Astounding" baseline for vision )in the meantime, ccv 0.6 open sources near state-of-the-art image classifier under Creative Commons Join the CompressiveSensing subreddit or the Google+ Community and post there ! Liked this entry ? subscribe to Nuit Blanche's feed, there's more where that came from. You can also subscribe to Nuit Blanche by Email, explore the Big Picture in […]

### April 18, 2014

+
danah boyd, author of 'It's Complicated' just gave a tech talk at Google. Her book has been in the news a lot lately, so I'll skip the details (although Facebook ought to be at least slightly worried).But what I enjoyed the most about her talk was the feeling that I was listening to a true netizen: someone who lives and breathes on the internet, understands (and has helped build) modern technology extremely well (she is a computer scientist as well as an ethnographer), and is able to deliver a […]
+
No summary available for this post.
+
...we do not yet have the perspective of sufficient time to get over the prejudices and fashionabilities that influence our everyday behavior. We also tend to discount or oversimplify historical, sociological, and psychological aspects. We are too operational and too win-lose oriented. We come out simplistic and opinionated. Leland Allen, quoted in Polywater, by Felix Franks.
+
Modernity II An obvious missing addition in my previous Modernity post was (as pointed out by Franklin Chen in the comments) was LaTeX, developed in the early 1980s as a set of macros for TeX (released in 1978). By the way, if you prefer … Continue reading →
+
Découvert sur Freakonometrics une chaîne d'articles sur nos 10 bouquins préférés, alors voici une sélection des miens. Cent ans de solitude Au moment où j'hésitais à ne mentionner que des livres en rapport avec la science, j'apprends le décès de Gabriel García … Lire la suite →
+
WebValley 2014 applications are open for the INTEL ISEF track from today to May, the 11th!
+
you believe speckle is noise,your internet of things gadget does not have a camera,your business depends on making sense of camera data and you don't know about OverFeat, Caffe or ccv,you believe compressive sensing is niche,you believe that random projections are inferior to PCA,you believe the name of an implementation does the same as the name of the algorithmyou believe sensor design has little to do with Machine Learning.... TBC Join the CompressiveSensing subreddit or the Google+ […]
+
Here is something new in the privacy game that relies on the fact that most matrix factorization in the recommender system business are low rank. From the paper:To the best of our knowledge, we are the rst to take into account the data disclosed by an analyst in the above privacy-accuracy tradeo , and to establish the optimality of a combined disclosure, obfuscation, and prediction scheme. Our proofs rely on the modeling assumption that is the cornerstone of matrix factorization techniques and […]
+
Just released on YouTube: video of Drew Berry’s awesome Virus one billion times installation, created for Melbourne’s White Night. Drew gave a short talk on this work at VIZBI 2014.
+
This evening something reminded me of the following line from Rudyard Kipling’s famous poem If: … If all men count with you, but none too much … It would be good career advice for a mathematician to say “Let all…Read more ›