APPROX 2015 - PDF Preprint Papers

APPROX 2015 International Workshop on Approximation Algorithms for

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed APPROX-2015 Paper

click to vote

APPROX
2015
Springer

62views Algorithms» more APPROX 2015»

Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness

8 years 8 months ago

Download drops.dagstuhl.de

Low-degree polynomial approximations to the sign function underlie pseudorandom generators for halfspaces, as well as algorithms for agnostically learning halfspaces. We study the...

Mark Bun, Thomas Steinke

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	62	Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness	claim
2	61	The Container Selection Problem	claim
3	57	Inapproximability of H-Transversal/Packing	claim
4	56	Local Convergence of Random Graph Colorings	claim
5	54	Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials	claim
6	52	Minimizing Maximum Flow-time on Related Machines	claim
7	51	Swendsen-Wang Algorithm on the Mean-Field Potts Model	claim
8	49	On Linear Programming Relaxations for Unsplittable Flow in Trees	claim
9	49	Dimension Expanders via Rank Condensers	claim
10	47	Learning Circuits with few Negations	claim
11	43	Approximate Nearest Neighbor Search in Metrics of Planar Graphs	claim
12	36	How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking	claim
13	35	Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees	claim
14	33	Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees	claim
15	32	Dependent Random Graphs and Multi-Party Pointer Jumping	claim
16	32	Deletion Codes in the High-noise and High-rate Regimes	claim
17	32	Approximating Dense Max 2-CSPs	claim
18	32	A Chasm Between Identity and Equivalence Testing with Conditional Queries	claim
19	30	Approximating Upper Degree-Constrained Partial Orientations	claim
20	29	Communication with Partial Noiseless Feedback	claim
21	29	A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs	claim
22	29	Fully Dynamic Bin Packing Revisited	claim
23	28	Non-Uniform Robust Network Design in Planar Graphs	claim
24	28	Correlation in Hard Distributions in Communication Complexity	claim
25	27	Spectral Norm of Random Kernel Matrices with Applications to Privacy	claim
26	26	Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree	claim
27	24	Large Supports are Required for Well-Supported Nash Equilibria	claim
28	24	Approximating Hit Rate Curves using Streaming Algorithms	claim
29	23	Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums	claim
30	23	Tighter Connections between Derandomization and Circuit Lower Bounds	claim
31	22	Zero-One Laws for Sliding Windows and Universal Sketches	claim
32	22	On Approximating Node-Disjoint Paths in Grids	claim
33	21	Designing Overlapping Networks for Publish-Subscribe Systems	claim
34	21	Approximate Hypergraph Coloring under Low-discrepancy and Related Promises	claim
35	21	Separating Decision Tree Complexity from Subcube Partition Complexity	claim
36	21	Stochastic and Robust Scheduling in the Cloud	claim
37	21	Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms	claim
38	20	Sequential Importance Sampling Algorithms for Estimating the All-Terminal Reliability Polynomial of Sparse Graphs	claim
39	19	Harnessing the Bethe Free Energy	claim
40	19	On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs	claim
41	17	Terminal Embeddings	claim
42	17	Tight Bounds for Graph Problems in Insertion Streams	claim
43	17	A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties	claim
44	16	Two Structural Results for Low Degree Polynomials and Applications	claim
45	16	Improved NP-Inapproximability for 2-Variable Linear Equations	claim
46	16	Towards a Characterization of Approximation Resistance for Symmetric CSPs	claim
47	14	Internal Compression of Protocols to Entropy	claim
48	13	On Guillotine Cutting Sequences	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers