ycliper

Популярное

Музыка Кино и Анимация Автомобили Животные Спорт Путешествия Игры Юмор

Интересные видео

2025 Сериалы Трейлеры Новости Как сделать Видеоуроки Diy своими руками

Топ запросов

смотреть а4 schoolboy runaway турецкий сериал смотреть мультфильмы эдисон
Скачать

Research Seminar: "Black-box Optimization" by Prof. Tara Javidi

Автор: SigProcessing

Загружено: 2021-10-12

Просмотров: 635

Описание: Spring 2021 SIP Seminar Series: April 21, 2021
[http://www.inspirelab.us/seminars/]

Speaker: Prof. Tara Javidi

Abstract: In this talk, we will consider the problem of maximizing a black-box function via noisy and costly queries from a theoretical perspective (a lot of it) as well as applications (an exciting bit). We first motivate the problem by considering a wide variety of engineering design applications from the heuristic optimization of wireless networks to hardware acceleration to neural network architecture search.

In the second part of the talk, we consider the problem in a Bayesian framework with a Gaussian Process prior. In particular, a new algorithm for this problem is proposed, and high probability bounds on its simple and cumulative regret are established. The query point selection rule in most existing methods involves an exhaustive search over an increasingly fine sequence of uniform discretizations of the input space. The proposed algorithm, in contrast, adaptively refines the domain which leads to a lower computational complexity, particularly when the domain is a subset of a high dimensional Euclidean space. In addition to the computational gains, sufficient conditions are identified under which the regret bounds of the new algorithm improve upon the known results.

In the last part of the talk, we build on the intuition provided by our work in the Bayesian setting to consider the problem in a non-Bayesian setting where the objective function is assumed to have a smooth kernel representation. Most notably the proposed algorithm –augmenting the Gaussian Process surrogate with a local polynomial estimator— closes a significant gap to the (optimal) regret lower bound for a class of widely used and practically relevant Matern family of Kernels. This is joint work with my PhD student Shekhar Shubhanshu.

Biography: Dr. Javidi is a professor of electrical and computer engineering at University of California, San Diego. She received her MS and PhD degrees in Electrical Engineering and Computer Science as well as her MS in Applied Mathematics from the University of Michigan, Ann Arbor. Before joining UCSD, she was on the faculty of Electrical Engineering Department at the University of Washington, Seattle; In 2013-2014, she spent her sabbatical at Stanford University as a visiting faculty. Her area of research is at the intersection of stochastic control, information theory, and data science with notable contributions to the theory of information acquisition and active learning. At the University of California, San Diego, Tara is a founding co-director of the Center for Machine-Integrated Computing and Security, the principal investigator of Detect Drone Project as well as a faculty member of the member of the Centers of Information Theory and Applications (ITA), Halıcıoğlu Data Science Institute, Wireless Communications (CWC), Contextual Robotics Institute (CRI) and Networked Systems (CNS).

Не удается загрузить Youtube-плеер. Проверьте блокировку Youtube в вашей сети.
Повторяем попытку...
Research Seminar: "Black-box Optimization" by Prof. Tara Javidi

Поделиться в:

Доступные форматы для скачивания:

Скачать видео

  • Информация по загрузке:

Скачать аудио

Похожие видео

Research Seminar:

Research Seminar: "Graph Ricci Flow and Applications" by Prof. Jie Gao

Zi Wang - Bayesian Optimization for Global Optimization of Expensive Black-box Functions

Zi Wang - Bayesian Optimization for Global Optimization of Expensive Black-box Functions

Bayesian Approaches for Black Box Optimization

Bayesian Approaches for Black Box Optimization

Research Seminar:

Research Seminar: "Accelerated Gradient Methods on Riemannian Manifolds" by Prof. Suvrit Sra

Метод черного ящика: как быстро усвоить сложные концепции

Метод черного ящика: как быстро усвоить сложные концепции

Fall 2019

Fall 2019

Nate Veldt -- PhD Defense

Nate Veldt -- PhD Defense

Roberto Calandra - Bayesian optimization for robotics

Roberto Calandra - Bayesian optimization for robotics

Vizier: Black-box optimization and AutoML - Pittsburgh ML Summit ‘19

Vizier: Black-box optimization and AutoML - Pittsburgh ML Summit ‘19

Jonathan Blow on Why AI Can't Program

Jonathan Blow on Why AI Can't Program

Bayesian Optimization - Math and Algorithm Explained

Bayesian Optimization - Math and Algorithm Explained

AI Fails at 96% of Jobs (New Study)

AI Fails at 96% of Jobs (New Study)

Lec 21 : Black-Box Optimization Problems

Lec 21 : Black-Box Optimization Problems

2. Bayesian Optimization

2. Bayesian Optimization

Bayesian Optimization

Bayesian Optimization

Research Seminar:

Research Seminar: "A User Guide to Low-Pass Graph Signal Processing" by Prof. Anna Scaglione

Lecture: Unconstrained Optimization (Derivative-Free Methods)

Lecture: Unconstrained Optimization (Derivative-Free Methods)

Why the Past Still Exists | Leonard Susskind

Why the Past Still Exists | Leonard Susskind

What does the GOLDEN PATH look like?

What does the GOLDEN PATH look like?

© 2025 ycliper. Все права защищены.



  • Контакты
  • О нас
  • Политика конфиденциальности



Контакты для правообладателей: [email protected]