3.8 Proceedings Paper

How Much Data Is Sufficient to Learn High-Performing Algorithms? Generalization Guarantees for Data-Driven Algorithm Design

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Proceedings Paper Computer Science, Theory & Methods

Pandora's Box with Correlations: Learning and Approximation

Shuchi Chawla et al.

2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020) (2020)

Article Economics

Efficiency and budget balance in general quasi-linear domains

Swaprava Nath et al.

GAMES AND ECONOMIC BEHAVIOR (2019)

Proceedings Paper Computer Science, Theory & Methods

A General Theory of Sample Complexity for Multi-Item Profit Maximization

Maria-Florina Balcan et al.

ACM EC'18: PROCEEDINGS OF THE 2018 ACM CONFERENCE ON ECONOMICS AND COMPUTATION (2018)

Proceedings Paper Computer Science, Theory & Methods

Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization

Maria-Florina Balcan et al.

2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS) (2018)

Article Computer Science, Theory & Methods

A PAC APPROACH TO APPLICATION-SPECIFIC ALGORITHM SELECTION

Rishi Gupta et al.

SIAM JOURNAL ON COMPUTING (2017)

Proceedings Paper Computer Science, Theory & Methods

Efficient Empirical Revenue Maximization in Single-Parameter Auction Environments

Yannai A. Gonczarowski et al.

STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (2017)

Proceedings Paper Computer Science, Theory & Methods

Learning Multi-item Auctions with (or without) Samples

Yang Cai et al.

2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS) (2017)

Article Management

Automated Design of Revenue-Maximizing Combinatorial Auctions

Tuomas Sandholm et al.

OPERATIONS RESEARCH (2015)

Article Biochemical Research Methods

Identification of alternative topological domains in chromatin

Darya Filippova et al.

ALGORITHMS FOR MOLECULAR BIOLOGY (2014)

Proceedings Paper Computer Science, Theory & Methods

The Sample Complexity of Revenue Maximization

Richard Cole et al.

STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING (2014)

Article Economics

Roberts' Theorem with neutrality: A social welfare ordering approach

Debasis Mishra et al.

GAMES AND ECONOMIC BEHAVIOR (2012)

Article Computer Science, Artificial Intelligence

ParamILS: An Automatic Algorithm Configuration Framework

Frank Hutter et al.

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH (2009)

Article Computer Science, Hardware & Architecture

Empirical Hardness Models: Methodology and a Case Study on Combinatorial Auctions

Kevin Leyton-Brown et al.

JOURNAL OF THE ACM (2009)

Article Multidisciplinary Sciences

Comprehensive Mapping of Long-Range Interactions Reveals Folding Principles of the Human Genome

Erez Lieberman-Aiden et al.

SCIENCE (2009)

Article Computer Science, Artificial Intelligence

SATzilla: Portfolio-based algorithm selection for SAT

Lin Xu et al.

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH (2008)

Article Computer Science, Theory & Methods

The RPR2 rounding technique for semidefinite programs

Uriel Feige et al.

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC (2006)

Article Multidisciplinary Sciences

Tropical geometry of statistical models

L Pachter et al.

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2004)

Article Multidisciplinary Sciences

Parametric inference for biological sequence analysis

L Pachter et al.

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2004)