图 书 馆开课单位--以色列理工学院
21
22
23
24
25
21On Stochastic and Worst-case Models for Investing[关于投资的随机和最坏情况模型]
Elad Hazan(以色列理工学院) In practice, most investing is done assuming a probabilistic model of stock price returns known as the Geometric Brownian Motion (GBM). While it is of...
热度：36
Elad Hazan(以色列理工学院) In practice, most investing is done assuming a probabilistic model of stock price returns known as the Geometric Brownian Motion (GBM). While it is of...
热度：36
22Opportunistic Strategies for Generalized No-Regret Problems[广义无悔问题的机会策略]
Andrey Bernstein(以色列理工学院) No-regret algorithms has played a key role in on-line learning and prediction problems. In this paper, we focus on a generalized no-regret problem wit...
热度：86
Andrey Bernstein(以色列理工学院) No-regret algorithms has played a key role in on-line learning and prediction problems. In this paper, we focus on a generalized no-regret problem wit...
热度：86
23Pointwise Tracking the Optimal Regression Function[点态跟踪最优回归函数]
Yair Wiener(以色列理工学院) This paper examines the possibility of a "reject option" in the context of least squares regression. It is shown that using rejection it is ...
热度：83
Yair Wiener(以色列理工学院) This paper examines the possibility of a "reject option" in the context of least squares regression. It is shown that using rejection it is ...
热度：83
24Data Mining with Differential Privacy[具有差异隐私的数据挖掘]
Arik Friedman(以色列理工学院 ) We consider the problem of data mining with formal privacy guarantees, given a data access interface based on the differential privacy framework. Diff...
热度：48
Arik Friedman(以色列理工学院 ) We consider the problem of data mining with formal privacy guarantees, given a data access interface based on the differential privacy framework. Diff...
热度：48
25A simple multi-armed bandit algorithm with optimal variation-bounded regret[一种简单的多臂强盗算法，具有最佳变异 - 有界遗憾]
Elad Hazan(以色列理工学院 ) We pose the question of whether it is possible to design a simple, linear-time algorithm for the basic multi-armed bandit problem in the adversarial s...
热度：138
Elad Hazan(以色列理工学院 ) We pose the question of whether it is possible to design a simple, linear-time algorithm for the basic multi-armed bandit problem in the adversarial s...
热度：138