[{"run_id":"20260906T231458-5fdd2fff","semester":"1272","observed_at":"2026-09-06 23:14:58.172943+00:00","record_version_id":"5ef8fe7b9a2fd26f32db90bdab88adcc266317127d664b0e4ce293e4cd77b735","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"20260907T155543-ce3781c4","semester":"1272","observed_at":"2026-09-07 15:55:43.033547+00:00","record_version_id":"5ef8fe7b9a2fd26f32db90bdab88adcc266317127d664b0e4ce293e4cd77b735","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-03b0bbb9723907cf3d1b41cf0bb34837dc398e42","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"d79834fdacdcdd31cb2a0f8af05b2c3c7b3c477e083ea6ae2dd0bebdd7c722de","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-0837245627eb714ae6bb0375f7abe8f41042011f","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"d79834fdacdcdd31cb2a0f8af05b2c3c7b3c477e083ea6ae2dd0bebdd7c722de","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-08c92e359bbbc110b0778b7e0b15d6f40000e6b1","semester":"1262","observed_at":"2025-08-21 07:05:14.730696+00:00","record_version_id":"a95f6d8bf7208718c866bed5c10e21b6587ec2eb353bb579ceb524cf485b95fb","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-0944d76440dc778fbb89626058c10451009ce9c6","semester":"1262","observed_at":"2025-05-21 03:36:18.194118+00:00","record_version_id":"ae42080f50b5ef517726366ad919cb58ac981a2a1b2b17673822ff130c394058","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-0a7f4bce29c816ef4d3d71b4eb8a2a3e15e33cc1","semester":"1262","observed_at":"2025-06-18 20:04:02.695444+00:00","record_version_id":"5784896cdb2b78ef6088b2fdba0b3114860072eda002529e3c6167b39703ca5f","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-0ab917f827a7de22ebdc1087114d377a31c4687b","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"746f619ab62d741b760714e5517fb0b5cd9407803075a5778b771b9df5e41747","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-0c40ecab4b6db9333d1f18aef816e3ee659e300c","semester":"1262","observed_at":"2025-05-25 18:02:34.797617+00:00","record_version_id":"40a8dd8bb59f56edab25c29514f7a16e3a9ebd7dd036b88e3b9afb70f4aa5e4d","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-0cb4d29a588ec7f11c7e00b7cf5dc3a0d23d0349","semester":"1266","observed_at":"2026-01-22 01:00:26.555427+00:00","record_version_id":"33dd459e6138546204ee165664ffc9938bf1ee022caf81304a858ac4d24f980f","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-11c30ec39e91498cbfcf3a923c53a4b03e387280","semester":"1262","observed_at":"2025-07-20 04:58:26.847117+00:00","record_version_id":"ed110c02cd8aaa70e33108405a2d07bea13f01b77db0f66ac0aa700ea2e47c8a","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-13cd500edf2587e9a3428f326253738fbea965ea","semester":"1264","observed_at":"2025-12-14 04:50:04.653658+00:00","record_version_id":"4e28cf2bde62e828d5bc7ab1c7e7938c1bd9f5f1c5bc6b1b7630acdb1f6a64af","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-1da08b2de39f05e6bc877c189fc2fd6eeda563f5","semester":"1262","observed_at":"2025-07-01 00:03:56.707251+00:00","record_version_id":"ed110c02cd8aaa70e33108405a2d07bea13f01b77db0f66ac0aa700ea2e47c8a","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-2031af47efe133b0e7877f433286ff07385afc41","semester":"1262","observed_at":"2025-07-02 20:16:45.749584+00:00","record_version_id":"c43425e1267dcc16436509783b5eeacdaadd3cd12a955a5bfb5c327a84e5aae4","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-238eba6f32fbc30407f616dd0628ff02a2a824dd","semester":"1262","observed_at":"2025-08-17 05:15:07.788352+00:00","record_version_id":"45307fd3af80263bb15ef760b1647505a3bf0596a6669688f1e4cf4dc65e94e4","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-25f0ff56bc4d80f8a8afa1a0bcce8dae6fddb5e5","semester":"1262","observed_at":"2025-05-25 17:20:25.942090+00:00","record_version_id":"aa09e7a893add4f6ec30f8e45d1242592b7a91f793eaf751a4e48ac8769c9a80","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-2923f91826ce253b7aeefa9f75b4a39fe4c80ff0","semester":"1262","observed_at":"2025-08-10 05:10:25.938416+00:00","record_version_id":"a494bf434abeba7d995c91deecac7fa8fb8a864471ad11b41c4090e0094fea5b","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-2a05214a4023e0157fa6f7d188c85308f714176c","semester":"1262","observed_at":"2025-09-07 04:56:38.255315+00:00","record_version_id":"d9b0930dfef6725ee5d17e33ddfe3b642abcf76b3e78044a7bb6c3184d0b50d9","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-2b1b8e39131de92b94620b25c5bbb25690efed4c","semester":"1262","observed_at":"2025-06-01 07:54:53.913454+00:00","record_version_id":"4be3a1427383a205dee4789c37ca0467f04afb03d4c276208275fc9a8769e1fc","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-33a1225644e5a5855d60f66e65413946e72fedf4","semester":"1262","observed_at":"2025-06-22 01:52:05.152650+00:00","record_version_id":"4c5409b158775e8dce0fbe08c260951b54885814eff57fb6c96df5ef6cd189ab","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-3b89c83dbf5208e13756184de1f2b2d0c09af35f","semester":"1262","observed_at":"2025-06-30 06:40:10.235522+00:00","record_version_id":"d8110f0a92bd9978ba8bc6831372d288203eb2ed891e912390cbc21d8336f0da","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-3c3eebf7f35c39364b445a2fa5a112ce28dbb4a1","semester":"1262","observed_at":"2025-06-01 17:03:59.062985+00:00","record_version_id":"614951864eb80f7d860049a4f86962e5792d8c2449137106066ff16fa51c07f4","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-3fa4dd71391f1c9cf4ab2216680bbc428689f92d","semester":"1262","observed_at":"2025-05-25 01:15:58.180530+00:00","record_version_id":"6d9587f773fc38911fc932df22ba6eff7cfb33017a618f56a6d991d64caffa48","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-4040aa216da722a34483f68fc1e129ea571ae08d","semester":"1262","observed_at":"2025-06-01 07:27:39.695506+00:00","record_version_id":"27f3ecaf39eabe368aed33af88f9d4e4c89b97e0c5ad8d24016fd3c2351f857b","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-454d53cd690294459f8ad0793cc3ed562060e56c","semester":"1262","observed_at":"2025-05-25 01:34:00.536004+00:00","record_version_id":"f87b18c722202b4c14a15a8f8e05d312eed9ef5fd8d5ce17c7069a7b96fc2c58","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-486f091e051fdb4ccdb80ee7b4fb0a5814510324","semester":"1264","observed_at":"2025-11-16 05:32:31.273726+00:00","record_version_id":"4fd713a462b189b35b31d0aab4e6a01060979b1c7cb05688420d0a1f2c9e7b6a","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-50393cfc5fd5598d4f4731ef1919f2ff53af07d9","semester":"1262","observed_at":"2025-06-30 06:05:57.438846+00:00","record_version_id":"d900491c12617da7eb45ac878c93b9ff843cdade08248bc69509e0d41605a7d8","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-50f6947786b208c800db8bbd0cec84a8f0f187d2","semester":"1262","observed_at":"2025-06-02 03:49:42.915428+00:00","record_version_id":"b8524333859113c60d4e7cf5cfdc22057727739ff59b0e21bbdaae3c29fc2840","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-51d86ed4082dced3803c295419b0ec8440942016","semester":"1264","observed_at":"2025-11-12 04:50:41.141307+00:00","record_version_id":"ea8d9e04b5e77228c3839d30da237220eb4c1c0094eea91681c37baddb05543a","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-53101bd1c10db0d00d094e4c9154d4c244ff23d9","semester":"1262","observed_at":"2025-10-05 04:58:05.366968+00:00","record_version_id":"f599a9f9bc1a74c2212ab32a76894d8d37aeb530b52dd8749dc1cc149384bebb","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-58751151c564e11c5cb8aedd3a2d3527c22f73eb","semester":"1262","observed_at":"2025-06-01 06:59:01.536576+00:00","record_version_id":"dfbe76f6c4c7d3bc66f4844d312a7c2cf4db16d0c505569a26b9d49285f3e959","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-5c4c8d3701a333ba4ddadef7d0b5dde8440fcdf0","semester":"1262","observed_at":"2025-06-01 01:57:51.256704+00:00","record_version_id":"956bba0c03e2fcff1c0cce25fcf36f08b51ce45a258171566a1ab63230dab1e2","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-5d20d9f81651d3c83fcaa2fd10870ce6e5d5a685","semester":"1262","observed_at":"2025-05-21 16:48:48.484741+00:00","record_version_id":"b1ee6b03db62a95c40115c05f67137739eb21de1497661da9654abcfdef95f8b","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-5feaebf2ab37051c86ad360cc0fa0d7e0e2ea295","semester":"1262","observed_at":"2025-05-24 15:58:23.378859+00:00","record_version_id":"6473ffe680b5e26fdc0368169309feb9d3769fc064f2fa3e9a1d450cf671b341","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-60949965544fce098cc006354e201149005fb77b","semester":"1264","observed_at":"2025-10-26 05:07:14.077864+00:00","record_version_id":"d2dfb9ff4e97f46ef33d3114024ce390b0af029588c6bf4fe8618c2b77fb873d","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-639225ac3addf8522f1d30cb4fe26054ea7f8c49","semester":"1262","observed_at":"2025-06-01 08:14:42.497608+00:00","record_version_id":"265324d85fbcf00f8ee723322618bd1ce7944cd3fbebc2c71f4f016747289b64","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-64093b17b3a9c67a41aa33eb37adb53ec38df714","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"afc7b3dacee8e09ad798d4f8029ef57faf1003a29726c9b171a40f40e0dcbfe6","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-6885b56099f55e08aa0205546369fb0381d50e13","semester":"1262","observed_at":"2025-07-13 04:59:22.367394+00:00","record_version_id":"bf37e106c41e0395811571b998309b75b8eb549cc27897827b199513ea9d9996","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-69d4b2b16e8268f75b6390b3a0e2ce8bf73999da","semester":"1262","observed_at":"2025-06-30 03:21:29.925498+00:00","record_version_id":"e1aaf93d02801648a55b232c4d9ed7dd73da953fa71b167e255a7d24ebe52801","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-6b29c3e0673b2f9a736d2363db5409e03d5b3ed4","semester":"1264","observed_at":"2025-12-03 12:33:41.418072+00:00","record_version_id":"b092c02880b21765dc19fe39ed7d477af090662ba558ae49c7702ade181a50aa","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-73259984748de484976ef2ad56ad7ab3d4cb4518","semester":"1262","observed_at":"2025-06-26 08:27:56.461216+00:00","record_version_id":"6890f0218ed2304148193f7634e0e0ed49cdc2832eaae21042806d43747e9eb8","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-741602fbc6252c232a0b9e6bc1a9ae3101625f5a","semester":"1262","observed_at":"2025-06-30 22:49:32.522034+00:00","record_version_id":"b995f561f2c2b203ca3c224d166c7cb07afcfaab8552abc1fcb48117ac7ecc8f","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-7774f45558276ec29bf626e58fffb4a27bdbb2a9","semester":"1264","observed_at":"2025-11-01 11:49:36.359151+00:00","record_version_id":"fae4c349791b8d2dbc24ca2fc42f613a3346f4c4fccac309478956dfeddd8d36","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-7ab7c5e783fc8ebef8b8ee8cea019ee37a72ce74","semester":"1262","observed_at":"2025-09-28 04:58:07.340658+00:00","record_version_id":"acf3c720764828c1e30251349bcb92f6152e7a592ffdb97a7b9288f35154009f","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-7b2f22d83ea05055ab90dcb77dc802382cccc6f7","semester":"1262","observed_at":"2025-05-21 17:56:46.096741+00:00","record_version_id":"a64affc6443c5ea7bc903c36ff5400aecf255e5f3673171289110e865e55f670","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-7ca1175502be18eb51f7b016818a884a43fd4ebb","semester":"1262","observed_at":"2025-07-29 06:28:23.644795+00:00","record_version_id":"4663e7dcce65ee6b7e97695e356fe50a46d95e6de6718c02d8482412162765ab","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-7d8cee5e42602ad9ba5dc0322085af2fa0dffaac","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"764d6c0cc56f9b008e008abb424d15f7dea216f9458eba9f42ca6de8a4874f20","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-81a0d6a7f668c98c59bd05fa988aa079c5ad1f68","semester":"1262","observed_at":"2025-05-31 07:49:50.419452+00:00","record_version_id":"67cbe22a14bf439af9fbcf3678b9a90b9583e67c79d74ad711837f83b73ccade","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-82f31c08c746a214872494cde6ecaeb9330441b4","semester":"1262","observed_at":"2025-06-17 21:26:08.547156+00:00","record_version_id":"e4a64c436b11b8370f9abddd41c3274b1cfe8358927d563a68b2d7a3c10618cc","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-84c248343c5a99ab42c5616c594812a5e3e31cbb","semester":"1262","observed_at":"2025-07-04 06:00:07.487827+00:00","record_version_id":"d8d3176e279857ffb55895a7c945b78bfd5c14309f6a1c95ad4112c3431f55de","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-86334e7275e315853287e8580c35456c68df800b","semester":"1262","observed_at":"2025-05-22 06:53:03.336354+00:00","record_version_id":"fcd4b6f89eb9f9525c2b34b8462d5e884faa4ec7832d369d475d04d85e5f4e33","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-8686dc1664f93a6c05f50321410961b39b12f91b","semester":"1262","observed_at":"2025-05-28 10:17:41.595894+00:00","record_version_id":"a12af4d8f8e3f175de973d4c8626a838fa777f4a386869019c8c57bdc86242e4","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-86d941366886c9a14a2581c04e20d0bdd25e1b02","semester":"1262","observed_at":"2025-08-31 04:54:14.656039+00:00","record_version_id":"e6e420d430738357be518739f168edb0f2980f0067357c4edc3f11b54beedb7f","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-8ba1d2e6cfbb1525b4f9f769ec164fb6ad0f237a","semester":"1262","observed_at":"2025-06-02 05:22:45.010398+00:00","record_version_id":"94221c689ce432785e796de250e908e491cdcec043ced506933975e979e08c5a","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-90e5aa456689a3b222016c05c319bbcd0bddd453","semester":"1262","observed_at":"2025-05-25 02:00:10.037905+00:00","record_version_id":"4ee74f3aba4f68834feb309cdf70b80be1eb70a4839d2cee2131fece6b25dc54","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-92d960aa7e4cd6e4c9ac8b2e232092904038e9e4","semester":"1262","observed_at":"2025-06-08 01:50:46.451351+00:00","record_version_id":"d60124d9e0268629ac4aa454d0025c875d997debe2707de4bf7f1aea5a64b8cb","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-94002ae588a8f71eca6d64105f2e603e8587293b","semester":"1262","observed_at":"2025-05-21 09:01:16.021508+00:00","record_version_id":"d904c7ddae44508cf03bb4ca839bd239b2257eb38ad0496a3e7cd110d7a368b7","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-9dd575e013c5c6e000ab3ad2d1288cc1dd9c96dc","semester":"1264","observed_at":"2025-12-21 04:47:46.589081+00:00","record_version_id":"e8765bf1cd1b8c357d21506e82c72bd8db651a92cc2b6d89611262a95bf91e99","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-a1ea26ed78cbd6e94bc3221e50a6ed9b6bf43871","semester":"1262","observed_at":"2025-05-25 09:16:55.180581+00:00","record_version_id":"d6c85d740959ae5993c7709a9a314baf63a2b308ada248b875fda6cc64d12a72","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-a76a3505853d5ea9c13bb98472b87361d469e2ee","semester":"1262","observed_at":"2025-05-28 18:03:41.793846+00:00","record_version_id":"a93d4af5e3278bfd96789d1e1da87754703ed5289605030bd28b2772cabf5c81","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-b285d591f6acf3aa1910e02edc297664db86eb8c","semester":"1262","observed_at":"2025-06-10 22:48:22.460295+00:00","record_version_id":"720f69adb8ba8779edded025d6638a2340c4ae846280f7c989f196da49d21c12","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-b79af756e4f00ba98231feb859ed8e98239eb811","semester":"1262","observed_at":"2025-05-22 02:47:56.931581+00:00","record_version_id":"14a78485b21f643034cc7197ac3ad30c9ce4fe3a0793c919ebb86d2a6eb64047","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-b89e05b94730c6471439082d9279c0a834a4aeec","semester":"1262","observed_at":"2025-08-26 20:25:42.325239+00:00","record_version_id":"b3bcf1782499f750a98bf0b5986eec8e8ea7cd24b579f13151f376d71a15f88e","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-b9279a12d1f2688df9e556183c94d41a89e431dc","semester":"1262","observed_at":"2025-07-06 01:49:47.203835+00:00","record_version_id":"f4a48c5cebcd86d4f5f7e57d523801ced0f9f435205799b8994c20c15306c739","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-bbdc905e96cc681a5e9a8b02c795b682206e36d1","semester":"1262","observed_at":"2025-06-25 08:02:45.445730+00:00","record_version_id":"f43c63ff061d1d30bbd0a48c2194b5c21328d9abc45747dbcbc275056aed7944","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-bde225b5243a13d81827aa173e39c78a652b54a0","semester":"1262","observed_at":"2025-05-23 07:22:33.219345+00:00","record_version_id":"718b16a77d43b583c101909677f78c4067ad85f6b2b128d408e7d051f3cfde24","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-c1fac4cbfde737f4f4ac02cdf15e6f5a9b5b676d","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"764d6c0cc56f9b008e008abb424d15f7dea216f9458eba9f42ca6de8a4874f20","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-c6b62be45f8a13cba109ef2a7741b9cd9a6b8272","semester":"1262","observed_at":"2025-08-24 08:48:09.035112+00:00","record_version_id":"b36c3f81bd52285488a81e70f9cf2b166ef2525aea05572f6d94135b44ab6d67","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-cc83f62cb6db61f39320916d819ad48ce55cd96d","semester":"1262","observed_at":"2025-05-22 00:45:35.735230+00:00","record_version_id":"b708b80f523bf77b04245a634cdf1e4bcb89ca28826d3993534d8eebbacbfdbe","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-d33818a01b6b4c5e2902e704da6e5b713742d4dc","semester":"1262","observed_at":"2025-10-13 10:46:24.251475+00:00","record_version_id":"4bf5b37994cc01547f967c3b6ef5cf0d423d0d76d2cbc718b6246e4f4230216d","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-d3c17db9832d3064916046caf891dd23f10b1bb9","semester":"1262","observed_at":"2025-08-26 11:30:42.288639+00:00","record_version_id":"aaad554bfd789fb0196ca7cbbf52b48388817c0667250131c01dd3ed5f004640","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-d4ee226dc44268e9b6767fb9f5f20343322f494b","semester":"1262","observed_at":"2025-06-15 01:52:23.911697+00:00","record_version_id":"a5fd15281d365c6b705aef4942e194e4a48dc15c15b0cce45dcaf0d0fcb6029c","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-d8f9fc7f136e2033556d9d65bbdbdf33425dbdc9","semester":"1262","observed_at":"2025-05-28 16:48:12.400438+00:00","record_version_id":"ab8f1c22e9c2c3b53ca29507bf2ab4e88fd89e41c8196c7cbd0fcdf0341b03bc","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-dbbc9739c616c3846b2e796e00a36fa41225f7d8","semester":"1262","observed_at":"2025-06-01 17:47:19.325144+00:00","record_version_id":"d61f62f8e5e025982b5c33dddcd242e95d932b4fbfe0347f74772ca157ddb834","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-dbe5f2d24b48c3177297a3d69c553cc9d1194bac","semester":"1262","observed_at":"2025-09-14 05:00:27.366070+00:00","record_version_id":"bb9cf4d6a81075f3b90a1668189d15c374238634cab36ddda35d46ab2538b6f5","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-dd357dc2758e9e282c30988a527ce37de92593b9","semester":"1264","observed_at":"2025-10-19 01:39:41.951404+00:00","record_version_id":"7d35786d266b74fcc6d1434c9968cfb6a6c4646eb5f277e18c87ab7bc895cd2a","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-de74de559e409a3fe668685e28043b888d2e6841","semester":"1262","observed_at":"2025-06-27 07:38:50.882897+00:00","record_version_id":"dac3cb0dc7ca79fe5f91f67a8107b84fc696f87a3dc53a87b366f16c417d7102","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-deca7188cf536ade3203cd88b52a45e92a059617","semester":"1262","observed_at":"2025-06-27 00:37:46.087071+00:00","record_version_id":"746672d48292ca0661b91bf34147d797ef2b53c011d0df9c3fbc973a4369484d","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-df60fa9ac3931c5612b0fa641b7a6f5fbec86fab","semester":"1262","observed_at":"2025-05-24 06:36:37.554678+00:00","record_version_id":"5caecde9a149d67025301063da735116affd1d196bab07a87ce88177896d291b","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-e339da2d849aaf8bb4dceca07a84728af23cf755","semester":"1262","observed_at":"2025-07-23 08:49:22.748925+00:00","record_version_id":"7ddbaa0eeff7ecb148dc781e8afebae14a76344e842f11e712a8a88be6b9b822","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-e934b1784835f5d36ae9b7ef0992b11e72c39142","semester":"1262","observed_at":"2025-06-01 06:21:25.219533+00:00","record_version_id":"fc2bd9e375a765f41344a0019885361404008770f9624026f0f4a00abe1a749b","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-ef471690c082448deebd2687eab84b0b78813c36","semester":"1262","observed_at":"2025-06-29 01:47:56.317645+00:00","record_version_id":"4ac3bb7619250771d520a72f075980726aafec18b6feff92cd46144f5641cf22","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-efc4e8e2cd7c3f68e059a308990c00c77c7611eb","semester":"1264","observed_at":"2025-10-16 05:48:13.935141+00:00","record_version_id":"1a52d9cca5bac658d4905953ab57369c40927464b357bec7b98a04ed5ecd2fc7","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"},{"run_id":"legacy-f18b7749725097d41f69c60779ff38cf073b93b3","semester":"1262","observed_at":"2025-05-21 19:52:03.259353+00:00","record_version_id":"a78254a00d1dfed2c23b1f5e590f435b3fd9679ef037c9c7be0e86fc3cea1c00","course_id":"MATH 718","course_uid":"course_4c518c7aee577750986dc7c8","catalog_version_id":"6abd77afa0c5cc2fb52089990f2a655229eb67f24bcc7121e0cd542d31bdf6a8","course_number":718,"subjects":["MATH"],"title":"RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS","description":"Random solvers have been playing increasingly crucial roles in the modern computational tasks. The recent breakthroughs in applied and computational linear algebra that incorporate techniques of randomization have proven to be of great importance in modern applied math, computational sciences and data science, such as inverse problems, machine learning and scientific computing. The guiding principle is that one may greatly reduce computational and storage expenses at the cost of a small probability of failure. Systematic study of these modern methods of randomized linear algebra solvers will be provided, presenting mathematical backgrounds, algorithms, and concrete applications. Core theoretical topics include randomized Kaczmarz and its generalization to stochastic gradient descent, randomized singular value decomposition, random sketching, matrix completion, and compressive sensing, and corresponding applications.","requirements_text":"Graduate/professional standing or declared in Mathematics VISP (graduate or dissertator)"}]