CS: Parallel Camp, SCM, NASA Reduced Gravity Opportunity, Around the Blogs in 80 hours, Apprentissage et Parcimonie

I am probably going to go to the Parallel Camp in two days from now but I am not sure what I want to talk about nor what I want to get out of meeting people that are into GPUs. However, If I make a presentation, I will feature it here.. The day before there will be a meeting at SCM entitled "Les limites de la modélisation" (in french), I look forward to the talk on MOX.

I made pitch for the HASP flight recently (Imaging Earth from 120,000 feet: Four Years Later.), but if instead of having hardware flying at 100,000 you prefer go a joy ride in Microgravity, you may want to think of a experiment that could fly on NASA's Reduced Gravity Aircraft (yes the vomit comet), as I said before, make sure you know why you are doing that if you are qualified:

NASA seeks undergraduates to defy gravity for Science and Engineering: Proposals Due October 27

The Reduced Gravity Student Flight Opportunities Program provides a unique academic experience for undergraduate students to successfully propose, design, fabricate, fly and evaluate a reduced gravity experiment of their choice.  Application deadline, flight dates, and other important dates for the 2011 Campaign have been announced.  Please share this information with faculty and students.

Letters of Interest (Optional) Due:         September 22, 2010
Proposals Due:                                          October 27, 2010
Announcement of Selected Teams:      December 8, 2010

Flight Week:                                                 June 2-11, 2011

Information about the program and the application process can be found on the microgravity website (http://microgravityuniversity.jsc.nasa.gov/).

The blog entries you may have missed:

• First, I agree with Andrew, this essay by Mandelbrot is fascinating

  A maverick’s apprenticeship. The Wolf Prize for Physics. Edited by David Thouless. Singapore: World Scientific, 2004. [ PDF (154.4 KB) ]

• Alex: Find a generating function for the Stirling partition numbers and Random matrix sparsification, comparison of current results
• Djalil: Back to basics: total variation distance
• Bob: CFP: 8th Sound and Music Computing (SMC) Conference 2011, and Sound Quality Seminar, Papers of the Day (Po'D): Finding or Not Finding Rules in Time Series Edition
• Muthu: Romance Leads to Insights
• Dick: Strong Codes For Weak Channels
• Gregory: 2011 MIT IAP course, build a synthetic aperture radar in 4 weeks
• Brian: Solving Resistor Networks Using Gaussian Elimination — An Illustration and Inverting A’CA
• 
• ISW: IsInvariant Proposes New Sensor Technology (increasing dynamic range, I can see how CS would benefit from that)
• Meena: Quantitative white matter fiber analysis: a short history (Part III)
• Jason: A Simple and Computationally Efficient Sampling Approach to Covariate Adjustment for Multifactor Dimensionality Reduction Analysis of Epistasis
• Frank: Statistical manifold: Dual conjugate connections
• Arthur: Mandelbrot, fractals and counterexamples in applied probability, Margin of error, and comparing proportions in the same sample
• Gonzalo: Comments on information theory
• Terahertz Technology: ConverTec Corp. releases TeraLaz CO2 terahertz laser system

Finally, Remi Gribonval pointed out to the upcoming meeting next week (in French)

Apprentissage et Parcimonie

Date : 2010-11-10
Lieu : Telecom Paristech - B312
Thèmes scientifiques :
A - Méthodes et modèles en traitement de signal

Annonce

Les représentations parcimonieuses des signaux et des images reposent sur l'utilisation de dictionnaires redondants de formes d'ondes typiques de certaines classes de signaux ou d'images. Leur utilisation a connu un essor considérable ces dernières années notamment dans les domaines de la restauration, de la compression, de la séparation de sources et des problèmes inverses. Il existe de forts liens, notamment algorithmiques, entre ces modèles parcimonieux et la théorie statistique de l'apprentissage et de la sélection de modèle, et ses applications en apprentissage automatique.
L'objectif global de la journée est de favoriser la rencontre entre les communautés françaises du traitement du signal / de l'apprentissage statistique qui participent de concert au développement rapide du concept de parcimonie et à ses applications, depuis les fondement statistiques et théoriques jusqu'aux dernières avancées algorithmiques.
La journée sera organisée autour d'exposés invités qui permettront de dessiner l'état de l'art du domaine et des défis à venir.

Programme

Organisateurs: Rémi Gribonval et Francis Bach.

• 09h30-10h10 - Stéphane Mallat, Classification with Sparse or Invariant Representations ?
• 10h10-10h50 - Odalric Maillard, Least-Squares regression with random spaces
• 10h50-11h10 Pause café
• 11h10-11h50 - Matthieu Kowalski, Parcimonie et structures pour les décompositions des signaux dans des dictionnaires temps-fréquence
• 11h50-12h30 - Guillaume Obozinski, Parcimonie structurée et apprentissage de dictionnaire
• 14h00-14h40 - Jean-Christophe Pesquet, Algorithmes parallèles proximaux et applications
• 14h40-15h20 - Erwan Lepennec, Estimation de densité par méthode de Dantzig à pénalisation minimale
• 15h20-15h40 Pause café
• 15h40-16h20 - Onur Dikmen, Maximum marginal likelihood estimation for nonnegative dictionary learning
• 16h20-17h00 - Alexandre Tsybakov, Estimation de matrices de faible rang en grande dimension