Randomized Algorithms for Scientific Computing (RASC)
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
- Sandia National Lab. (SNL-CA), Livermore, CA (United States)
- Argonne National Laboratory (ANL), Argonne, IL (United States)
- Brookhaven National Laboratory (BNL), Upton, NY (United States)
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
- Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
- Univ. of California, Davis, CA (United States)
- Univ. of Texas, Austin, TX (United States)
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Univ. of California, Berkeley, CA (United States)
- Univ. of California, Santa Cruz, CA (United States)
- Pacific Northwest National Laboratory (PNNL), Richland, WA (United States)
- Univ. of Wisconsin, Madison, WI (United States)
Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.
- Research Organization:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
- DOE Contract Number:
- AC02-05CH11231
- OSTI ID:
- 2006805
- Resource Relation:
- Conference: RASC: Randomized Algorithms for Scientific Computing, Held Virtually, TN (United States), 2-3 Dec 2020, 6-7 Jan 2021; Related Information: https://web.cvent.com/event/02659cce-b9d1-4935-9d0a-5b671ea52fca/
- Country of Publication:
- United States
- Language:
- English
Similar Records
Position Papers for the ASCR Workshop on Cybersecurity and Privacy for Scientific Computing Ecosystems
Data and Communications in Basic Energy Sciences: Creating a Pathway for Scientific Discovery