skip to main content
10.1145/2213977.2214044acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

Making polynomials robust to noise

Published: 19 May 2012 Publication History

Abstract

A basic question in any computational model is how to reliably compute a given function when the inputs or intermediate computations are subject to noise at a constant rate. Ideally, one would like to use at most a constant factor more resources compared to the noise-free case. This question has been studied for decision trees, circuits, automata, data structures, broadcast networks, communication protocols, and other models.
Buhrman et al. (2003) posed the noisy computation problem for real polynomials. We give a complete solution to this problem. For any polynomial p:{0,1}n->[-1,1], we construct a polynomial probust:Rn->R of degree O(deg p+log(1/ε)) that epsilon-approximates p and is robust to noise in the inputs: |p(x)-probust(x+δ)|<ε for all x∈ 0,1}n and all delta∈[-1/3,1/3]n. This result is optimal with respect to all parameters. We construct probust explicitly for each p. Previously, it was open to give such a construction even for p=x1 ⊕ x2 ⊕ ... ⊕ xn (Buhrman et al., 2003). The proof contributes a technique of independent interest, which allows one to force partial cancellation of error terms in a polynomial.

Supplementary Material

JPG File (stoc_8b_3.jpg)
MP4 File (stoc_8b_3.mp4)

References

[1]
S. Aaronson. Limitations of quantum advice and one-way communication. Theory of Computing, 1(1):1--28, 2005.
[2]
S. Aaronson and Y. Shi. Quantum lower bounds for the collision and the element distinctness problems. J. ACM, 51(4):595--605, 2004.
[3]
A. Ambainis. Polynomial degree vs. quantum query complexity. J. Comput. Syst. Sci., 72(2):220--238, 2006.
[4]
A. Ambainis, A. M. Childs, B. Reichardt, R. Spalek, and S. Zhang. Any AND-OR formula of size N can be evaluated in time N1/2 o(1) on a quantum computer. In Proceedings of the Forty-Eighth Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 363--372, 2007.
[5]
J. Aspnes, R. Beigel, M. L. Furst, and S. Rudich. The expressive power of voting polynomials. Combinatorica, 14(2):135--148, 1994.
[6]
R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. J. ACM, 48(4):778--797, 2001.
[7]
P. Beame, T. Huynh, and T. Pitassi. Hardness amplification in proof complexity. In Proceedings of the Forty-Second Annual ACM Symposium on Theory of Computing (STOC), pages 87--96, 2010.
[8]
P. Beame and D.-T. Huynh-Ngoc. Multiparty communication complexity and threshold circuit complexity of AC0. In Proceedings of the Fiftieth Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 53--62, 2009.
[9]
R. Beigel, N. Reingold, and D. A. Spielman. ¶P is closed under intersection. J. Comput. Syst. Sci., 50(2):191--202, 1995.
[10]
M. Braverman and A. Rao. Towards coding for maximum errors in interactive communication. In Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing (STOC), pages 159--166, 2011.
[11]
H. Buhrman, R. Cleve, and A. Wigderson. Quantum vs. classical communication and computation. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (STOC), pages 63--68, 1998.
[12]
H. Buhrman, R. Cleve, R. de Wolf, and C. Zalka. Bounds for small-error and zero-error quantum algorithms. In Proceedings of the Fortieth Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 358--368, 1999.
[13]
H. Buhrman, I. Newman, H. Röhrig, and R. de Wolf. Robust polynomials and quantum algorithms. Theory Comput. Syst., 40(4):379--395, 2007. Preliminary version at http://arxiv.org/abs/quant-ph/0309220v1, September 2003.
[14]
H. Buhrman, N. K. Vereshchagin, and R. de Wolf. On computation and communication with small bias. In Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (CCC), pages 24--32, 2007.
[15]
H. Buhrman and R. de Wolf. Communication complexity lower bounds by polynomials. In Proceedings of the Sixteenth Annual IEEE Conference on Computational Complexity (CCC), pages 120--130, 2001.
[16]
E. W. Cheney. Introduction to Approximation Theory. Chelsea Publishing, New York, 2nd edition, 1982.
[17]
C. Dutta, Y. Kanoria, D. Manjunath, and J. Radhakrishnan. A tight lower bound for parity in noisy communication networks. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1056--1065, 2008.
[18]
C. Dutta and J. Radhakrishnan. Lower bounds for noisy wireless networks using sampling algorithms. In Proceedings of the Forty-Ninth Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 394--402, 2008.
[19]
A. Eremenko and P. Yuditskii. Uniform approximation of sgn(x) by polynomials and entire functions. J. d'Analyse Mathématique, 101:313--324, 2007.
[20]
W. S. Evans and N. Pippenger. Average-case lower bounds for noisy Boolean decision trees. SIAM J. Comput., 28(2):433--446, 1998.
[21]
W. S. Evans and L. J. Schulman. Signal propagation and noisy circuits. IEEE Transactions on Information Theory, 45(7):2367--2373, 1999.
[22]
E. Farhi, J. Goldstone, and S. Gutmann. A quantum algorithm for the Hamiltonian NAND tree. Theory of Computing, 4(1):169--190, 2008.
[23]
U. Feige. On the complexity of finite random functions. Inf. Process. Lett., 44(6):295--296, 1992.
[24]
U. Feige and J. Kilian. Finding OR in a noisy broadcast network. Inf. Process. Lett., 73(1--2):69--75, 2000.
[25]
U. Feige, P. Raghavan, D. Peleg, and E. Upfal. Computing with noisy information. SIAM J. Comput., 23(5):1001--1018, 1994.
[26]
P. Gács and A. Gál. Lower bounds for the complexity of reliable Boolean circuits with noisy gates. IEEE Transactions on Information Theory, 40(2):579--583, 1994.
[27]
R. G. Gallager. Finding parity in a simple broadcast network. IEEE Transactions on Information Theory, 34(2):176--180, 1988.
[28]
R. Gelles, A. Moitra, and A. Sahai. Efficient and explicit coding for interactive communication. In Proceedings of the Fifty-Second Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2011. To appear.
[29]
N. Goyal, G. Kindler, and M. E. Saks. Lower bounds for the noisy broadcast problem. SIAM J. Comput., 37(6):1806--1841, 2008.
[30]
P. Høyer, M. Mosca, and R. de Wolf. Quantum search on bounded-error inputs. In Proc. of the 30th International Colloquium on Automata, Languages, and Programming (ICALP), pages 291--299, 2003.
[31]
J. Kahn, N. Linial, and A. Samorodnitsky. Inclusion-exclusion: Exact and approximate. Combinatorica, 16(4):465--477, 1996.
[32]
A. T. Kalai, A. R. Klivans, Y. Mansour, and R. A. Servedio. Agnostically learning halfspaces. SIAM J. Comput., 37(6):1777--1805, 2008.
[33]
H. Klauck, R. Spalek, and R. de Wolf. Quantum and classical strong direct product theorems and optimal time-space tradeoffs. SIAM J. Comput., 36(5):1472--1493, 2007.
[34]
D. J. Kleitman, F. T. Leighton, and Y. Ma. On the design of reliable Boolean circuits that contain partially unreliable gates. J. Comput. Syst. Sci., 55(3):385--401, 1997.
[35]
A. R. Klivans and R. A. Servedio. Learning DNF in time 2~O(n1/3). J. Comput. Syst. Sci., 68(2):303--318, 2004.
[36]
A. R. Klivans and A. A. Sherstov. Unconditional lower bounds for learning intersections of halfspaces. Machine Learning, 69(2--3):97--114, 2007. Preliminary version in Proceedings of the Nineteenth Annual Conference on Computational Learning Theory (COLT), 2006.
[37]
A. R. Klivans and A. A. Sherstov. Lower bounds for agnostic learning via approximate rank. Computational Complexity, 19(4):581--604, 2010. Preliminary version in Proceedings of the Twentieth Annual Conference on Computational Learning Theory (COLT), 2007.
[38]
M. Krause and P. Pudlák. On the computational power of depth-2 circuits with threshold and modulo gates. Theor. Comput. Sci., 174(1--2):137--156, 1997.
[39]
M. Krause and P. Pudlák. Computing Boolean functions by polynomials and threshold circuits. Comput. Complex., 7(4):346--370, 1998.
[40]
E. Kushilevitz and Y. Mansour. Computation in noisy radio networks. SIAM J. Discrete Math., 19(1):96--108, 2005.
[41]
N. Linial and N. Nisan. Approximate inclusion-exclusion. Combinatorica, 10(4):349--365, 1990.
[42]
M. L. Minsky and S. A. Papert. Perceptrons: An Introduction to Computational Geometry. MIT Press, Cambridge, Mass., 1969.
[43]
I. Newman. Computing in fault tolerance broadcast networks. In Proceedings of the Nineteenth Annual IEEE Conference on Computational Complexity (CCC), pages 113--122, 2004.
[44]
N. Nisan and M. Szegedy. On the degree of Boolean functions as real polynomials. Computational Complexity, 4:301--313, 1994.
[45]
R. Paturi and M. E. Saks. Approximating threshold circuits by rational functions. Inf. Comput., 112(2):257--272, 1994.
[46]
N. Pippenger. On networks of noisy gates. In Proceedings of the Twenty-Sixth Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 30--38, 1985.
[47]
A. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Sciences, Mathematics, 67:145--159, 2002.
[48]
A. A. Razborov and A. A. Sherstov. The sign-rank of $\AC^0$. SIAM J. Comput., 39(5):1833--1855, 2010. Preliminary version in Proceedings of the Forty-Ninth Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2008.
[49]
R. Reischuk and B. Schmeltz. Reliable computation with noisy circuits and decision trees--a general nłog n lower bound. In Proceedings of the Thirty-Second Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 602--611, 1991.
[50]
T. J. Rivlin. An Introduction to the Approximation of Functions. Dover Publications, New York, 1981.
[51]
L. J. Schulman. Communication on noisy channels: A coding theorem for computation. In Proceedings of the Thirty-Third Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 724--733, 1992.
[52]
L. J. Schulman. Coding for interactive communication. IEEE Transactions on Information Theory, 42(6):1745--1756, 1996.
[53]
A. A. Sherstov. Communication lower bounds using dual polynomials. Bulletin of the EATCS, 95:59--93, 2008.
[54]
A. A. Sherstov. Approximate inclusion-exclusion for arbitrary symmetric functions. Computational Complexity, 18(2):219--247, 2009. Preliminary version in Proceedings of the Twenty-Third Annual IEEE Conference on Computational Complexity (CCC), 2008.
[55]
A. A. Sherstov. The intersection of two halfspaces has high threshold degree. In Proceedings of the Fiftieth Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 343--362, 2009.
[56]
A. A. Sherstov. Separating AC0 from depth-2 majority circuits. SIAM J. Comput., 38(6):2113--2129, 2009. Preliminary version in Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing (STOC), 2007.
[57]
A. A. Sherstov. Optimal bounds for sign-representing the intersection of two halfspaces by polynomials. In Proceedings of the Forty-Second Annual ACM Symposium on Theory of Computing (STOC), pages 523--532, 2010.
[58]
K.-Y. Siu, V. P. Roychowdhury, and T. Kailath. Rational approximation techniques for analysis of neural networks. IEEE Transactions on Information Theory, 40(2):455--466, 1994.
[59]
D. A. Spielman. Highly fault-tolerant parallel computation. In Proceedings of the Thirty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 154--163, 1996.
[60]
M. Szegedy and X. Chen. Computing Boolean functions from multiple faulty copies of input bits. Theor. Comput. Sci., 321(1):149--170, 2004.
[61]
J. Tarui and T. Tsukiji. Learning DNF by approximating inclusion-exclusion formulae. In Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity (CCC), pages 215--221, 1999.
[62]
R. de Wolf. A note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric functions. Quantum Information and Computation, 8(10):943--950, 2008.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computing
May 2012
1310 pages
ISBN:9781450312455
DOI:10.1145/2213977
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 May 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. computation with noise
  2. polynomial approximation
  3. real polynomials on the boolean hypercube

Qualifiers

  • Research-article

Conference

STOC'12
Sponsor:
STOC'12: Symposium on Theory of Computing
May 19 - 22, 2012
New York, New York, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25
57th Annual ACM Symposium on Theory of Computing (STOC 2025)
June 23 - 27, 2025
Prague , Czech Republic

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2022)An area law for 2d frustration-free spin systemsProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3519962(12-18)Online publication date: 9-Jun-2022
  • (2022)Entanglement Subvolume Law for 2D Frustration-Free Spin SystemsCommunications in Mathematical Physics10.1007/s00220-022-04381-2393:2(955-988)Online publication date: 15-Apr-2022
  • (2021)Guest ColumnACM SIGACT News10.1145/3444815.344482551:4(48-72)Online publication date: 14-Jan-2021
  • (2021)Lower Bounding the AND-OR Tree via SymmetrizationACM Transactions on Computation Theory10.1145/343438513:1(1-11)Online publication date: 21-Jan-2021
  • (2020)From boltzmann machines to neural networks and back againProceedings of the 34th International Conference on Neural Information Processing Systems10.5555/3495724.3496257(6354-6365)Online publication date: 6-Dec-2020
  • (2020)Entanglement subvolume law for 2d frustration-free spin systemsProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3357713.3384292(868-874)Online publication date: 22-Jun-2020
  • (2020)Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research)Advances in Mathematical Sciences10.1007/978-3-030-42687-3_7(107-126)Online publication date: 17-Jul-2020
  • (2015)Dual lower bounds for approximate degree and Markov-Bernstein inequalitiesInformation and Computation10.1016/j.ic.2014.12.003243:C(2-25)Online publication date: 1-Aug-2015
  • (2015)On the Power of Parity Queries in Boolean Decision TreesTheory and Applications of Models of Computation10.1007/978-3-319-17142-5_10(99-109)Online publication date: 16-Apr-2015
  • (2014)Breaking the minsky-papert barrier for constant-depth circuitsProceedings of the forty-sixth annual ACM symposium on Theory of computing10.1145/2591796.2591871(223-232)Online publication date: 31-May-2014
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media