The topology of fullerenes

P Schwerdtfeger, LN Wirz… - Wiley Interdisciplinary …, 2015 - Wiley Online Library
Fullerenes are carbon molecules that form polyhedral cages. Their bond structures are
exactly the planar cubic graphs that have only pentagon and hexagon faces. Strikingly, a …

Contextual decision processes with low bellman rank are pac-learnable

N Jiang, A Krishnamurthy, A Agarwal… - International …, 2017 - proceedings.mlr.press
This paper studies systematic exploration for reinforcement learning (RL) with rich
observations and function approximation. We introduce contextual decision processes …

Image biomarker standardisation initiative

A Zwanenburg, S Leger, M Vallières, S Löck - arXiv preprint arXiv …, 2016 - arxiv.org
The image biomarker standardisation initiative (IBSI) is an independent international
collaboration which works towards standardising the extraction of image biomarkers from …

The anatomy of the 2016 South Australia blackout: A catastrophic event in a high renewable network

R Yan, TK Saha, F Bai, H Gu - IEEE Transactions on Power …, 2018 - ieeexplore.ieee.org
Over the last decade, many power systems have significantly changed with the proliferation
of renewable generation sources, such as wind and solar photovoltaic. Due to their …

[图书][B] Lectures on convex optimization

Y Nesterov - 2018 - Springer
Yurii Nesterov Second Edition Page 1 Springer Optimization and Its Applications 137 Yurii
Nesterov Lectures on Convex Optimization Second Edition Page 2 Springer Optimization and …

Adapting to misspecification in contextual bandits

DJ Foster, C Gentile, M Mohri… - Advances in Neural …, 2020 - proceedings.neurips.cc
A major research direction in contextual bandits is to develop algorithms that are
computationally efficient, yet support flexible, general-purpose function approximation …

Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm

KL Clarkson - ACM Transactions on Algorithms (TALG), 2010 - dl.acm.org
The problem of maximizing a concave function f (x) in the unit simplex Δ can be solved
approximately by a simple greedy algorithm. For given k, the algorithm can find a point x (k) …

On augmented Lagrangian methods with general lower-level constraints

R Andreani, EG Birgin, JM Martínez… - SIAM Journal on …, 2008 - SIAM
Augmented Lagrangian methods with general lower-level constraints are considered in the
present research. These methods are useful when efficient algorithms exist for solving …

Geometrical characterization of non-Markovianity

S Lorenzo, F Plastina, M Paternostro - Physical Review A—Atomic, Molecular …, 2013 - APS
We introduce a tool for the quantitative characterization of the departure from Markovianity of
a given dynamical process. Our tool can be applied to a generic N-level system and …

Robust online Hamiltonian learning

CE Granade, C Ferrie, N Wiebe… - New Journal of …, 2012 - iopscience.iop.org
In this work we combine two distinct machine learning methodologies, sequential Monte
Carlo and Bayesian experimental design, and apply them to the problem of inferring the …