NDLI: The power of localization for efficiently learning linear separators with noise

Please wait, while we are loading the content...

Fingerprinting codes and the price of approximate differential privacy

Analyze gauss: optimal bounds for privacy-preserving principal component analysis

Private matchings and allocations

Rounding sum-of-squares relaxations

Constant factor approximation for balanced cut in the PIE model

Entropy, optimization and counting

Polynomial bounds for the grid-minor theorem

An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem

Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs

Deciding first-order properties of nowhere dense graphs

Pseudorandom generators with optimal seed length for non-boolean poly-size circuits

On derandomizing algorithms that err extremely rarely

Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas

Lower bounds for depth 4 formulas computing iterated matrix multiplication

The limits of depth reduction for arithmetic formulas: it's all about the top fan-in

A super-polynomial lower bound for regular arithmetic formulas

A characterization of locally testable affine-invariant properties via decomposition theorems

$L_{p}-testing$

Turnstile streaming algorithms might as well be linear sketches

Linear time construction of compressed text indices in compact space

New algorithms and lower bounds for circuits with linear threshold gates

Formulas vs. circuits for small distance connectivity

Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture

Breaking the minsky-papert barrier for constant-depth circuits

Economic efficiency requires interaction

The sample complexity of revenue maximization

Optimal competitive auctions

The matching polytope has exponential extension complexity

Homological product codes

Exponential improvement in precision for simulating sparse Hamiltonians

A quantum algorithm for computing the unit group of an arbitrary degree number field

Primal beats dual on online packing LPs in the random-order model

Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints

Minimum bisection is fixed parameter tractable

An efficient parallel solver for SDD linear systems

Solving SDD linear systems in nearly $mlog^{1/2}n$ time

Optimal CUR matrix decompositions

From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics

Shortest paths on polyhedral surfaces and terrains

Embedding and canonizing graphs of bounded genus in logspace

Testing surface area with arbitrary accuracy

Coin flipping of any constant bias implies one-way functions

An almost-optimally fair three-party coin-flipping protocol

Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices

Infinite randomness expansion with a constant number of devices

The average sensitivity of an intersection of half spaces

From average case complexity to improper learning complexity

The power of localization for efficiently learning linear separators with noise

Bandits with switching costs: $T^{2/3}$ regret

Online local learning via semidefinite programming

How to use indistinguishability obfuscation: deniable encryption, and more

How to delegate computations: the power of no-signaling proofs

Circuits resilient to additive attacks with applications to secure computation

On the existence of extractable one-way functions

Black-box non-black-box zero knowledge

Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions

Query complexity of approximate nash equilibria

Constant rank bimatrix games are PPAD-hard

Approximation algorithms for bipartite matching with metric and geometric costs

Distributed approximation algorithms for weighted shortest paths

Parallel algorithms for geometric graph problems

Fourier PCA and robust tensor decomposition

Smoothed analysis of tensor decompositions

Efficient density estimation via piecewise polynomial approximation

Super-polylogarithmic hypergraph coloring hardness via low-degree long codes

Analytical approach to parallel repetition

A characterization of strong approximation resistance

A strongly polynomial algorithm for generalized flow maximization

Approximate distance oracles with constant query time

Faster all-pairs shortest paths via circuit complexity

Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs

Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time

Community detection thresholds and the weak Ramanujan property

Distributed computability in Byzantine asynchronous systems

Are lock-free concurrent algorithms practically wait-free?

Multiway cut, pairwise realizable distributions, and descending thresholds

Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing

Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing

Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements

Every list-decodable code for high noise has abundant near-optimal rate puncturings

Non-malleable codes from additive combinatorics

Breaking the quadratic barrier for 3-LCC's over the reals

Optimal error rates for interactive coding I: adaptivity and other settings

The asymptotic k-SAT threshold

Satisfiability threshold for random regular NAE-SAT

Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region

Efficient deterministic approximate counting for low-degree polynomial threshold functions

Communication is bounded by root of rank

Communication lower bounds via critical block sensitivity

Computing with a full memory: catalytic space

Hitting sets for multilinear read-once algebraic branching programs, in any order

The power of localization for efficiently learning linear separators with noise

Content Provider	ACM Digital Library
Author	Awasthi, Pranjal Balcan, Maria Florina Long, Philip M.
Abstract	We introduce a new approach for designing computationally efficient and noise tolerant algorithms for learning linear separators. We consider the malicious noise model of Valiant [41, 32] and the adversarial label noise model of Kearns, Schapire, and Sellie [34]. For malicious noise, where the adversary can corrupt an η of fraction both the label part and the feature part, we provide a polynomial-time algorithm for learning linear separators in $R^{d}$ under the uniform distribution with nearly information-theoretically optimal noise tolerance of η = Ω(ε), improving on the $Ω(&epsilon/d^{1/4})$ noise-tolerance of [31] and the $Ω(ε^{2}/log(d/ε)$ of [35]. For the adversarial label noise model, where the distribution over the feature vectors is unchanged, and the overall probability of a noisy label is constrained to be at most η, we give a polynomial-time algorithm for learning linear separators in $R^{d}$ under the uniform distribution that can also handle a noise rate of η = Ω(ε). This improves over the results of [31] which either required runtime super-exponential in 1/ε (ours is polynomial in 1/ε) or tolerated less noise. In the case that the distribution is isotropic log-concave, we present a polynomial-time algorithm for the malicious noise model that tolerates $Ω(ε/log^{2}(1/ε))$ noise, and a polynomial-time algorithm for the adversarial label noise model that also handles $Ω(ε/log^{2}(1/ε))$ noise. Both of these also improve on results from [35]. In particular, in the case of malicious noise, unlike previous results, our noise tolerance has no dependence on the dimension d of the space. Our algorithms are also efficient in the active learning setting, where learning algorithms only receive the classifications of examples when they ask for them. We show that, in this model, our algorithms achieve a label complexity whose dependence on the error parameter ε is polylogarithmic (and thus exponentially better than that of any passive algorithm). This provides the first polynomial time active learning algorithm for learning linear separators in the presence of malicious noise or adversarial label noise.
Ending Page	458
Page Count	10
Starting Page	449
File Format	PDF MP4
ISBN	9781450327107
DOI	10.1145/2591796.2591839
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-05-31
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Noise tolerant learning Passive and active learning Malicious noise Adversarial label noise
Content Type	Audio Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in