ECCC 2006 - PDF Preprint Papers

ECCC 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ECCC-2006 Paper

click to vote

ECCC
2006

218views more ECCC 2006»

Efficient Algorithms for Online Game Playing and Universal Portfolio Management

13 years 4 months ago

Download www.cs.princeton.edu

We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...

Amit Agarwal, Elad Hazan

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	218	Efficient Algorithms for Online Game Playing and Universal Portfolio Management	claim
2	145	Constraint satisfaction: a personal perspective	claim
3	134	Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications	claim
4	123	A Note on Adaptivity in Testing Properties of Bounded Degree Graphs	claim
5	120	New Locally Decodable Codes and Private Information Retrieval Schemes	claim
6	116	Uniform Hardness Amplification in NP via Monotone Codes	claim
7	112	Faster algorithms for finding lowest common ancestors in directed acyclic graphs	claim
8	109	How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments	claim
9	107	Energy Complexity and Entropy of Threshold Circuits	claim
10	104	Graph partitioning via adaptive spectral techniques	claim
11	100	Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing	claim
12	99	On the Subgroup Distance Problem	claim
13	97	Runtime Analysis of a Simple Ant Colony Optimization Algorithm	claim
14	97	Cryptographic Hardness Results for Learning Intersections of Halfspaces	claim
15	96	An Unconditional Study of Computational Zero Knowledge	claim
16	96	When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---	claim
17	93	On the Deduction Theorem and Complete Disjoint NP-Pairs	claim
18	90	Comparing Reductions to NP-Complete Sets	claim
19	88	Some Results on Matchgates and Holographic Algorithms	claim
20	88	Hardness of Directed Routing with Congestion	claim
21	88	On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge	claim
22	87	The Learnability of Quantum States	claim
23	84	The Complexity of Forecast Testing	claim
24	84	Improved Algorithms for Optimal Embeddings	claim
25	82	The Complexity of Depth-3 Circuits Computing Symmetric Boolean Functions	claim
26	80	Packing to angles and sectors	claim
27	78	All Natural NPC Problems Have Average-Case Complete Versions	claim
28	77	Extractors and condensers from univariate polynomials	claim
29	77	Computational aspects of feedback in neural circuits	claim
30	75	Note on MAX 2SAT	claim
31	71	Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games	claim
32	70	Finding a Heaviest Triangle is not Harder than Matrix Multiplication	claim
33	68	Lempel-Ziv Dimension for Lempel-Ziv Compression	claim
34	65	Computational Complexity of Some Enumeration Problems About Uniformly Sparse Boolean Network Automata	claim
35	58	Scaled Dimension of Individual Strings	claim
36	53	An Omega(n^{1/3}) Lower Bound for Bilinear Group Based Private Information Retrieval	claim
37	51	Formula Caching in DPLL	claim
38	47	New correlation bounds for GF(2) polynomials using Gowers uniformity	claim
39	46	A Complete Public-Key Cryptosystem	claim
40	41	On a syntactic approximation to logics that capture complexity classes	claim
41	37	Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers