DOCSLIB.ORG

Anthony Bloch Named Chair Ate, and Post Doctoral Programs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Anthony Bloch Named Chair Ate, and Post Doctoral Programs ContinuUM Newsletter of the Department of Mathematics at the University of Michigan 2005 also in our healthy undergraduate, gradu- Anthony Bloch Named Chair ate, and post doctoral programs. These outstanding programs allow our faculty In July 2005, Trevor Wooley stepped down as Department Chair after a three-year term. much valued personal contact with stu- Anthony Bloch assumed the Chair’s role. Tony expresses his hopes for the department dents and with emerging young mathema- here, while Trevor’s reflections on the past year are on page 2. ticians who contribute to the liveliness of our research atmosphere. Our faculty I feel honored to be succeeding Trevor offerings ranging from basic required members are dedicated teachers, and we Wooley as Chair of the Department of Math- courses for non-math majors to highly ad- are fortunate that our high-quality graduate ematics. I look forward to working with my vanced specialized graduate courses. Also, students who are offered positions as colleagues, with the staff in the Department, visiting professors and exciting seminars are instructors use their strong teaching skills with Dean Terry part of an enjoyable in the service of our programs. We are McDonald, and with and stimulating aca- involved in various new initiatives in the University com- demic environment. teaching, and we are pursuing joint pro- munity at large. In addition, there is a grams in finance, information sciences and Trevor Wooley pervasive spirit of economics. cooperation and col- was a strong leader Our graduate program has continued to who really cared legiality. This creates a pleasant atmo- thrive. We have been fortunate to attract about the students some of the very best students, who chose and faculty. He al- sphere in the Depart- ment which aids and the University of Michigan because of our ways acted in their reputation, because of the great faculty, best interests and in enhances research, teaching, and study. and because of the opportunities offered the best interests of on campus. The challenge will be to keep the Department. Un- There will be seri- the level of funding in this area high der his guidance the ous issues to con- enough to allow us to be competitive so Department has tend with during my that we can continue to act as a magnet for gone from strength tenure as Chair. Con- the most talented students. to strength. I would tinuing budget chal- like to thank Trevor lenges form the main It is my hope that the Mathematics De- for all he accom- cloud on the horizon. partment will not only continue to be rec- plished and for the I hope the financial ognized for excellence, but that it will help he is currently problems will ease, continue to grow and to improve. Already providing to me. He but maintaining ex- it is renowned for both pure and applied will continue to be cellence in the face mathematics. It is also on course to de- an extremely valued member of the faculty, of constraints will be the greatest challenge. velop in the applied area through the Ap- and I wish him the very best for the future. Our high-quality faculty members are in de- plied and Interdisciplinary Mathematics mand and are continually sought after by (AIM) program. I hope that the pure and The Mathematics Department here at applied sides of the Department continue Michigan, one of the largest in the country, our peer departments around the country. I am sure I can speak for the College when I to work together in harmony and to inspire has a well-earned reputation for excellence. each other to even greater heights. The quality and commitment of the faculty say that we will be doing everything in our combine to create an extraordinarily strong power to retain our coveted faculty and to Our links with other departments on Department which was recently called one recruit equally accomplished academics to campus continue to strengthen. Math- of the best in the country by The New York maintain our high standard. We will try to ematics plays an ever-increasing role in Times. Our faculty are involved in active re- be competitive by creating economic condi- many other fields including the tradition- search projects supported by highly com- tions which complement the many other ad- ally mathematics-based scientific fields petitive external funding. They excel not vantages of serving our academic such as physics, engineering, and com- only in research, but also as teachers and community in such a congenial environ- puter science, as well as subjects such as mentors. Our undergraduate, graduate, and ment. biology, economics, and the social sci- post doctoral programs are exemplary. We The strength of our Math Department ences. Our academic and research are justly proud of the wide array of course lies not only in the caliber of the faculty, but Continued on page 2 Bloch, continued from page 1 View from the Chair’s Office interaction with these diverse departments is stimulating, should have far-reaching re- Trevor Wooley sults in research, and will be beneficial to all concerned. It is a great pleasure to be writing this scientific and social environment. The digi- As Chair, I will do my utmost to pre- column, in part as a means of welcoming tization of the modern world has delivered serve the quality of the Department and the our new Department Chair, Tony Bloch, but to mathematicians the opportunity and exciting educational opportunities pro- also because this marks my departure from duty to contribute ideas that nowadays vided to students and faculty alike. I will be the Kafkaesque realm of administration to have an essentially immediate impact on aided by many of my esteemed colleagues, the saner pastures of teaching and re- our way of life. It has been said that the key and I am grateful to all who are serving in search. science for the 21st Century is mathematics. administrative positions. At the same time, it is self-evident in the One of the sad features of modern (ca- There will be four Associate Chairs. modern age that no university can consider reer) administrators is the focus on estab- Joe Conlon has agreed to serve for another itself first-class in the absence of premier lishing a legacy rather than on prudent year as Associate Chair for Regular Fac- departments in the natural sciences. It is to decision-making given the circumstances at ulty. Juha Heinonen will continue as As- be hoped, therefore, that University leaders hand and those anticipated ahead. Permit sociate Chair for Graduate Studies. Curtis will grasp this reality and invest in math- me then to summarize my achievements as Huntington will serve as Associate Chair ematics so as to make the most of these op- Chair as simply managing what, for the De- for Education and head our actuarial pro- portunities and educational responsibilities. partment, amounted to the best of times gram. Dick Canary is coming on board to and the worst of times. We have experi- In wishing Tony Bloch well on taking fill the newly created position of Associate enced three successive years of painful over as Chair, I offer him my hopes for good Chair for Term Faculty. Mel Hochster will budget cuts. At the same time we have re- fortune in dealing with the formidable chal- serve as Chair of the Personnel Committee, cruited 11 outstanding faculty members, we lenges to come. Despite our current and Peter Scott and Peter Smereka will have a thriving postdoctoral program with strengths, our budgetary position has been continue on as Doctoral Chair and AIM Di- over 50 members (no fewer than 10 of worn thin to the point that our ability to re- rector, respectively. Ralf Spatzier is to whom next year will be supported by NSF tain excellent faculty, and to continue to of- head our IBL (inquiry-based learning) ini- Postdoctoral Fellowships), a graduate pro- fer a stimulating and flexible environment tiative, and Jeff Rauch will write our strate- gram strong enough to compete with the for undergraduate and graduate students, gic plan. Many other faculty members best in the nation, and an undergraduate is acutely stressed. Tony will need all of our have agreed to serve on the various key program with over 280 Mathematics majors, help to guide the Department through these committees including the Executive and rebounding to a size unseen by any but our difficult times. With a miracle or two, how- Personnel committees. On behalf of our more senior colleagues. ever, we may yet see the Department colleagues, I would like to thank them all Professional mathematicians—as we all achieve the potential that it so richly de- for their service. I would also like to take are who employ our mathematical training serves, and assume a stature of which our this opportunity to thank our invaluable in some aspect of our daily work—cannot alums may be proud. administrative staff, led most ably by fail to be struck by the transformation in re- Professor Trevor Wooley Doreen Fussman, who work behind the cent decades of the fabric of our economic, scenes to keep all aspects of the Depart- ment running smoothly. Faculty and I first came to the Mathematics Depart- graduate ment twenty-one years ago as a T. H. students enjoy Hildebrandt Assistant Professor and, with afternoon tea the exception of a six-year period, I have in the been lucky enough to be here ever since. Department’s In my opinion we have a unique and inspir- Common ing Department which offers a remarkably Room. stimulating environment to faculty and stu- dents alike.
Load more

Recommended publications
  • Anna C. Gilbert
    Anna C. Gilbert Dept. of Mathematics University of Michigan 530 Church Street Ann Arbor, MI 48109-1109 [email protected] 734-763-5728 (phone) http://www.math.lsa.umich.edu/~annacg 734-763-0937 (fax) Revision date: 30 October, 2017. Research • General interests: analysis, probability, signal processing, and algorithms. • Specialization: randomized algorithms with applications to massive datasets and signal processing. Education • Ph.D., Mathematics, Princeton University, June 1997, Multiresolution homogenization schemes for differential equations and applications, Professor Ingrid Daubechies, advisor. • S.B., Mathematics (with honors), University of Chicago, June 1993. Positions Held • Herman H. Goldstine Collegiate Professor. Department of Mathematics, University of Michigan, 2014{ present. • Full Professor (Courtesy appointment). Division of Electrical and Computer Engineering, University of Michigan, 2010{present. • Full Professor. Department of Mathematics, University of Michigan, 2010{present. • Associate Professor (Courtesy appointment). Division of Electrical and Computer Engineering, Uni- versity of Michigan, 2008{2010. • Associate Professor. Department of Mathematics, University of Michigan, 2007{2010. • Assistant Professor. Department of Mathematics, University of Michigan, 2004{2007. • Principal technical staff member. Internet and Network Systems Research Center, AT&T Labs-Research, 2002{2004. • Senior technical staff member. Information Sciences Research Center, AT&T Labs-Research, 1998{ 2002. • Visiting instructor. Department of Mathematics, Stanford University, Winter quarter 2000. • Postdoctoral research associate. Yale University and AT&T Labs-Research, 1997{1998. • Intern. Lucent Technologies Bell Laboratories, summer 1996. • Research assistant. Princeton University, 1994{1995. • Intern. AT&T Bell Laboratories, summers 1993{1995. Publications Refereed Journal Publications • F. J. Chung, A. C. Gilbert, J. G. Hoskins, and J. C. Schotland, \Optical tomography on graphs", Inverse Problems, Volume 33, Number 5, 2017.
    [Show full text]
  • Martin J. Strauss April 22, 2015
    Martin J. Strauss April 22, 2015 Work Address: Dept. of Mathematics University of Michigan Ann Arbor, MI 48109-1043 [email protected] http://www.eecs.umich.edu/~martinjs/ +1-734-717-9874 (cell) Research Interests • Sustainable Energy. • Fundamental algorithms, especially randomized and approximation algorithms. • Algorithms for massive data sets. • Signal processing and and computational harmonic analysis. • Computer security and cryptography. • Complexity theory. Pedagogical Interests • Manipulative Mathematics (teaching via pipe cleaners, paper folding and other mutilation, etc.) • Kinesthetic Mathematics (teaching through movement, including acting out algorithms, per- mutations, and other transformations). Education • Ph.D., Mathematics, Rutgers University, October 1995. Thesis title: Measure in Feasible Complexity Classes. Advisor: Prof. E. Allender, Dept. of Computer Science. • A.B. summa cum laude, Mathematics, Columbia University, May 1989. Minor in Computer Science. Employment History • Professor, Dept. of Mathematics and Dept. of Electrical Engineering and Computer Science (jointly appointed), University of Michigan, 2011{present. • Associate Professor, Dept. of Mathematics and Dept. of Electrical Engineering and Computer Science (jointly appointed), University of Michigan, 2008{2011. • Assistant Professor, Dept. of Mathematics and Dept. of Electrical Engineering and Computer Science (jointly appointed), University of Michigan, 2004{2008. • Visiting Associate Research Scholar, Program in Applied and Computational Mathematics, Princeton University, Sept. 2006{Feb. 2007. Page 1 of 17 • Principal investigator, AT&T Laboratories|Research, 1997{2004. Most recent position: Principal Technical Staff Member, Internet and Network Systems Research Center. • Consultant, Network Services Research Center, AT&T Laboratories, 1996. • Post-Doctoral Research Associate, Department of Computer Science, Iowa State University, September 1995{May 1996. • Intern. Speech recognition group, IBM Watson Research Center, summers, 1989{1990.
    [Show full text]
  • Focm 2017 Foundations of Computational Mathematics Barcelona, July 10Th-19Th, 2017 Organized in Partnership With
    FoCM 2017 Foundations of Computational Mathematics Barcelona, July 10th-19th, 2017 http://www.ub.edu/focm2017 Organized in partnership with Workshops Approximation Theory Computational Algebraic Geometry Computational Dynamics Computational Harmonic Analysis and Compressive Sensing Computational Mathematical Biology with emphasis on the Genome Computational Number Theory Computational Geometry and Topology Continuous Optimization Foundations of Numerical PDEs Geometric Integration and Computational Mechanics Graph Theory and Combinatorics Information-Based Complexity Learning Theory Plenary Speakers Mathematical Foundations of Data Assimilation and Inverse Problems Multiresolution and Adaptivity in Numerical PDEs Numerical Linear Algebra Karim Adiprasito Random Matrices Jean-David Benamou Real-Number Complexity Alexei Borodin Special Functions and Orthogonal Polynomials Mireille Bousquet-Mélou Stochastic Computation Symbolic Analysis Mark Braverman Claudio Canuto Martin Hairer Pierre Lairez Monique Laurent Melvin Leok Lek-Heng Lim Gábor Lugosi Bruno Salvy Sylvia Serfaty Steve Smale Andrew Stuart Joel Tropp Sponsors Shmuel Weinberger 2 FoCM 2017 Foundations of Computational Mathematics Barcelona, July 10th{19th, 2017 Books of abstracts 4 FoCM 2017 Contents Presentation . .7 Governance of FoCM . .9 Local Organizing Committee . .9 Administrative and logistic support . .9 Technical support . 10 Volunteers . 10 Workshops Committee . 10 Plenary Speakers Committee . 10 Smale Prize Committee . 11 Funding Committee . 11 Plenary talks . 13 Workshops . 21 A1 { Approximation Theory Organizers: Albert Cohen { Ron Devore { Peter Binev . 21 A2 { Computational Algebraic Geometry Organizers: Marta Casanellas { Agnes Szanto { Thorsten Theobald . 36 A3 { Computational Number Theory Organizers: Christophe Ritzenhaler { Enric Nart { Tanja Lange . 50 A4 { Computational Geometry and Topology Organizers: Joel Hass { Herbert Edelsbrunner { Gunnar Carlsson . 56 A5 { Geometric Integration and Computational Mechanics Organizers: Fernando Casas { Elena Celledoni { David Martin de Diego .
    [Show full text]
  • Focm 2017 Foundations of Computational Mathematics Barcelona, July 10Th-19Th, 2017 Organized in Partnership With
    FoCM 2017 Foundations of Computational Mathematics Barcelona, July 10th-19th, 2017 http://www.ub.edu/focm2017 Organized in partnership with Workshops Approximation Theory Computational Algebraic Geometry Computational Dynamics Computational Harmonic Analysis and Compressive Sensing Computational Mathematical Biology with emphasis on the Genome Computational Number Theory Computational Geometry and Topology Continuous Optimization Foundations of Numerical PDEs Geometric Integration and Computational Mechanics Graph Theory and Combinatorics Information-Based Complexity Learning Theory Plenary Speakers Mathematical Foundations of Data Assimilation and Inverse Problems Multiresolution and Adaptivity in Numerical PDEs Numerical Linear Algebra Karim Adiprasito Random Matrices Jean-David Benamou Real-Number Complexity Alexei Borodin Special Functions and Orthogonal Polynomials Mireille Bousquet-Mélou Stochastic Computation Symbolic Analysis Mark Braverman Claudio Canuto Martin Hairer Pierre Lairez Monique Laurent Melvin Leok Lek-Heng Lim Gábor Lugosi Bruno Salvy Sylvia Serfaty Steve Smale Andrew Stuart Joel Tropp Sponsors Shmuel Weinberger Wifi access Network: wifi.ub.edu Open a Web browser At the UB authentication page put Identifier: aghnmr.tmp Password: aqoy96 Venue FoCM 2017 will take place in the Historical Building of the University of Barcelona, located at Gran Via de les Corts Catalanes 585. Mapa The plenary lectures will be held in the Paraninf (1st day of each period) and Aula Magna (2nd and 3rd day of each period). Both auditorium are located in the first floor. The poster sessions (2nd and 3rd day of each period) will be at the courtyard of the Faculty of Mathematics, at the ground floor. Workshops will be held in the lecture rooms B1, B2, B3, B5, B6, B7 and 111 in the ground floor, and T1 in the second floor.
    [Show full text]
  • 40 IS10 Abstracts
    40 IS10 Abstracts IP1 age and video restoration. I will present the framework Approximate Inference in Graphical Models: The and provide numerous examples showing state-of-the-art Fenchel Duality Perspective results. I will then briefly show how to extend this to im- age classification, deriving energies and optimization pro- Quite a number of problems involving inference from data, cedures that lead to learning non-parametric dictionaries whether visual data or otherwise, can be set as a prob- for sparse representations optimized for classification. I lem of finding the most likely setting of variables of a will conclude by showing results on the extension of this to joint distribution over locally interacting variables. These sensing and the learning of incoherent dictionaries. Models include stereopsis, figure-ground segmentation, model-to- derived from universal coding are presented as well. The image matching, super-resolution, and so forth. Inference work I present in this talk is the result of great collabo- over locally interacting variables can be naturally repre- rations with J. Mairal, F. Rodriguez, J. Martin-Duarte, I. sented by a graphical model, however exact inference over Ramirez, F. Lecumberry, F. Bach, M. Elad, J. Ponce, and general graphs is computationally unwieldy. In the context A. Zisserman. of approximate inference, I will describe a general scheme for message passing update rules based on the framework Guillermo Sapiro of Fenchel duality. Using the framework we derive all University of Minnesota past inference algorithms like the Belief Propagation sum- Dept Electrical & Computer Engineering product and max-product, the Tree-Re-Weighted (TRW) [email protected] model as well as new convergent algorithms for maximum- a-posteriori (MAP) and marginal estimation using ”convex free energies”.
    [Show full text]
  • Future Directions in Compressed Sensing and the Integration of Sensing and Processing What Can and Should We Know by 2030?
    Future Directions in Compressed Sensing and the Integration of Sensing and Processing What Can and Should We Know by 2030? Robert Calderbank, Duke University Guillermo Sapiro, Duke University Workshop funded by the Basic Research Office, Office of the Assistant Prepared by Brian Hider and Jeremy Zeigler Secretary of Defense for Research & Engineering. This report does not Virginia Tech Applied Research Corporation necessarily reflect the policies or positions of the US Department of Defense Preface OVER THE PAST CENTURY, SCIENCE AND TECHNOLOGY HAS BROUGHT REMARKABLE NEW CAPABILITIES TO ALL SECTORS of the economy; from telecommunications, energy, and electronics to medicine, transportation and defense. Technologies that were fantasy decades ago, such as the internet and mobile devices, now inform the way we live, work, and interact with our environment. Key to this technological progress is the capacity of the global basic research community to create new knowledge and to develop new insights in science, technology, and engineering. Understanding the trajectories of this fundamental research, within the context of global challenges, empowers stakeholders to identify and seize potential opportunities. The Future Directions Workshop series, sponsored by the Basic Research Office of the Office of the Assistant Secretary of Defense for Research and Engineering, seeks to examine emerging research and engineering areas that are most likely to transform future technology capabilities. These workshops gather distinguished academic and industry researchers from the world’s top research institutions to engage in an interactive dialogue about the promises and challenges of these emerging basic research areas and how they could impact future capabilities. Chaired by leaders in the field, these workshops encourage unfettered considerations of the prospects of fundamental science areas from the most talented minds in the research community.
    [Show full text]
  • Computational Methods for Sparse Solution of Linear Inverse Problems Joel A
    PROCEEDINGS OF THE IEEE. SPECIAL ISSUE ON APPLICATIONS OF SPARSE REPRESENTATION AND COMPRESSIVE SENSING, VOL. XX, NO. YY, MONTH 20091 Computational Methods for Sparse Solution of Linear Inverse Problems Joel A. Tropp, Member, IEEE and Stephen J. Wright Abstract—The goal of the sparse approximation problem is find good solutions to large sparse approximation problems in to approximate a target signal using a linear combination of a reasonable time. few elementary signals drawn from a fixed collection. This paper In this paper, we give an overview of algorithms for sparse surveys the major practical algorithms for sparse approximation. Specific attention is paid to computational issues, to the circum- approximation, describing their computational requirements stances in which individual methods tend to perform well, and to and the relationships between them. We also discuss the the theoretical guarantees available. Many fundamental questions types of problems for which each method is most effective in electrical engineering, statistics, and applied mathematics in practice. Finally, we sketch the theoretical results that can be posed as sparse approximation problems, making these justify the application of these algorithms. Although low- algorithms versatile and relevant to a plethora of applications. rank regularization also falls within the sparse approximation Index Terms—Sparse Approximation, Compressed Sensing, framework, the algorithms we describe do not apply directly Matching Pursuit, Convex Optimization to this class of problems. Subsection I-A describes “ideal” formulations of sparse I. INTRODUCTION approximation problems and some common features of algo- INEAR inverse problems arise throughout engineering rithms that attempt to solve these problems. Section II provides L and the mathematical sciences.
    [Show full text]
  • Anna C. Gilbert
    Anna C. Gilbert Dept. of Mathematics University of Michigan 530 Church Street Ann Arbor, MI 48109-1109 [email protected] 734-763-5728 (phone) http://www.math.lsa.umich.edu/~annacg 734-763-0937 (fax) Revision date: 10 August, 2017. Research • General interests: analysis, probability, signal processing, and algorithms. • Specialization: randomized algorithms with applications to massive datasets and signal processing. Education • Ph.D., Mathematics, Princeton University, June 1997, Multiresolution homogenization schemes for differential equations and applications, Professor Ingrid Daubechies, advisor. • S.B., Mathematics (with honors), University of Chicago, June 1993. Positions Held • Herman H. Goldstine Collegiate Professor. Department of Mathematics, University of Michigan, 2014{ present. • Full Professor (Courtesy appointment). Division of Electrical and Computer Engineering, University of Michigan, 2010{present. • Full Professor. Department of Mathematics, University of Michigan, 2010{present. • Associate Professor (Courtesy appointment). Division of Electrical and Computer Engineering, Uni- versity of Michigan, 2008{2010. • Associate Professor. Department of Mathematics, University of Michigan, 2007{2010. • Assistant Professor. Department of Mathematics, University of Michigan, 2004{2007. • Principal technical staff member. Internet and Network Systems Research Center, AT&T Labs-Research, 2002{2004. • Senior technical staff member. Information Sciences Research Center, AT&T Labs-Research, 1998{ 2002. • Visiting instructor. Department of Mathematics, Stanford University, Winter quarter 2000. • Postdoctoral research associate. Yale University and AT&T Labs-Research, 1997{1998. • Intern. Lucent Technologies Bell Laboratories, summer 1996. • Research assistant. Princeton University, 1994{1995. • Intern. AT&T Bell Laboratories, summers 1993{1995. Publications Refereed Journal Publications • F. J. Chung, A. C. Gilbert, J. G. Hoskins, and J. C. Schotland, \Optical tomography on graphs", Inverse Problems, Volume 33, Number 5, 2017.
    [Show full text]
  • 32 IS06 Abstracts
    32 IS06 Abstracts CP1 lem from Surface Measurements Adaptive Finite Element Methods for Inverse Imaging Problems Assuming that the heat capacity of a body is negligible outside certain inclusions the heat equation degenerates to In many realistic 3d imaging problems, such as biomedical a parabolic-elliptic interface problem. For the case that the tumor diagnostics or underground imaging, the resolution heat conductivity is higher inside the inclusions we show by requested by practitioners is unachiavable using globally an adaptation of the so-called Factorization Method that refined meshes. However, while now the leading paradigm the locations of the interfaces are uniquely determined by in PDE solvers, adaptivity has not been widely used for thermal measurements on the surface of the body. We also inverse problems. We will present a mathematical frame- present some numerical results for this inverse problem. work for imaging applications using automatically adapted meshes, and present results obtained in optical tomography Otmar Scherzer for tumor detection and sound wave imaging applications. University Innsbruck [email protected] Wolfgang Bangerth Texas A&M University Bastian Gebauer [email protected] Institut f¨ur Mathematik, Joh. Gutenberg-Universit¨at Mainz, Germany [email protected] CP1 A New Approach to Inverse Problem Solving Using Florian Fr¨uhauf Radon-Based Representations Department of Computer Science, University of Innsbruck, Austria We carry out image deconvolution by transforming the fl[email protected] data into a new general discrete Radon domain that can handle any assumed boundary condition for the associ- ated matrix inversion problem. For each associated angular CP1 segment, one can apply deconvolution routines to smaller A Threshold-Based Method for Inverse Solutions (and possibly better) conditioned matrix inversion prob- to Reconstruct Complex Obstacles, with Applica- lems than the matrix inversion problem for the entire im- tion to the Inverse Problem of Electrocardiography age.
    [Show full text]
  • Computational Methods for Sparse Solution of Linear Inverse Problems Joel A
    PROCEEDINGS OF THE IEEE. SPECIAL ISSUE ON APPLICATIONS OF SPARSE REPRESENTATION AND COMPRESSIVE SENSING, VOL. XX, NO. YY, MONTH 20091 Computational Methods for Sparse Solution of Linear Inverse Problems Joel A. Tropp, Member, IEEE and Stephen J. Wright Abstract—The goal of the sparse approximation problem is find good solutions to large sparse approximation problems in to approximate a target signal using a linear combination of a reasonable time. few elementary signals drawn from a fixed collection. This paper In this paper, we give an overview of algorithms for sparse surveys the major practical algorithms for sparse approximation. Specific attention is paid to computational issues, to the circum- approximation, describing their computational requirements stances in which individual methods tend to perform well, and to and the relationships between them. We also discuss the the theoretical guarantees available. Many fundamental questions types of problems for which each method is most effective in electrical engineering, statistics, and applied mathematics in practice. Finally, we sketch the theoretical results that can be posed as sparse approximation problems, making these justify the application of these algorithms. Although low- algorithms versatile and relevant to a plethora of applications. rank regularization also falls within the sparse approximation Index Terms—Sparse Approximation, Compressed Sensing, framework, the algorithms we describe do not apply directly Matching Pursuit, Convex Optimization to this class of problems. Subsection I-A describes “ideal” formulations of sparse I. INTRODUCTION approximation problems and some common features of algo- INEAR inverse problems arise throughout engineering rithms that attempt to solve these problems. Section II provides L and the mathematical sciences.
    [Show full text]
  • The Sixth Vasil Popov Prize Awarded to Joel A. Tropp of California Institute of Technology
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Appl. Comput. Harmon. Anal. 29 (2010) 1 Contents lists available at ScienceDirect Applied and Computational Harmonic Analysis www.elsevier.com/locate/acha Announcement The Sixth Vasil Popov Prize awarded to Joel A. Tropp of California Institute of Technology Thirteenth International Conference in Approximation Theory San Antonio, Texas, March 8, 2010 The Popov Prize honors the memory of Vasil A. Popov (1942–1990), the Bulgarian analyst best known for his work in Nonlinear Approximation. The Prize is awarded every third year to a young mathematician (less than six years removed from the Ph.D.) for outstanding research contributions to Approximation Theory and/or related ar- eas. Previous Popov Prize winners are Albert Cohen (Paris), Arno Kuijlaars (The Netherlands), Emmanuel Candes (Stan- ford), Serguei Denissov (Wisconsin–Madison), and Mauro Maggioni (Duke). Joel Tropp was recognized for his outstanding contribu- tions to the development of sparse reconstruction methods in the context of approximation from redundant systems, greedy algorithms, and most recently compressed sens- ing. In particular, he has shown that greedy algorithms will with high probability exactly recover sparse vectors from random measurements, e.g., based on Gaussian or Bernoulli distributions. This was a cornerstone result in showing the efficacy of greedy algorithms for decoding in compressed sensing. Another impressive result by Joel Tropp is the now famous COSAMP algorithm of Needell and Tropp, which were the first to establish the opti- mal performance of greedy decoding in 2. Tropp’s work has significantly advanced the understanding of greedy al- Joel Tropp is an Assistant Professor of Applied and Computational Math- ematics at the California Institute of Technology.
    [Show full text]
  • Randomized Algorithms for Scientific Computing (RASC)
    Randomized Algorithms for Scientific Computing (RASC) Report from the DOE ASCR Workshop held December 2–3, 2020, and January 6–7, 2021 Prepared for U.S. Department of Energy Office of Science Advanced Scientific Computing Research Program RASC Report Authors Aydın Bulu¸c(co-chair), Lawrence Berkeley National Laboratory Tamara G. Kolda (co-chair), Sandia National Laboratories Stefan M. Wild (co-chair), Argonne National Laboratory Mihai Anitescu, Argonne National Laboratory Anthony DeGennaro, Brookhaven National Laboratory John Jakeman, Sandia National Laboratories Chandrika Kamath, Lawrence Livermore National Laboratory Ramakrishnan (Ramki) Kannan, Oak Ridge National Laboratory Miles E. Lopes, University of California, Davis Per-Gunnar Martinsson, University of Texas, Austin Kary Myers, Los Alamos National Laboratory Jelani Nelson, University of California, Berkeley Juan M. Restrepo, Oak Ridge National Laboratory C. Seshadhri, University of California, Santa Cruz Draguna Vrabie, Pacific Northwest National Laboratory Brendt Wohlberg, Los Alamos National Laboratory Stephen J. Wright, University of Wisconsin, Madison Chao Yang, Lawrence Berkeley National Laboratory Peter Zwart, Lawrence Berkeley National Laboratory arXiv:2104.11079v1 [cs.AI] 19 Apr 2021 DOE/ASCR Point of Contact Steven Lee Randomized Algorithms for Scientific Computing i Additional Report Authors This report was a community effort, collecting inputs in a variety formats. We have taken many of the ideas in this report from the thesis statements collected from registrants of “Part 2” of the workshop. We further solicited input from community members with specific expertise. Much of the input came from discussions at the workshop, so we must credit the entire set of participants listed in full in AppendixB. Although we cannot do justice to the origination of every idea contained herein, we highlight those whose contributions were explicitly solicited or whose submissions were used nearly verbatim.
    [Show full text]