article

Predicting {0, 1}-functions on randomly drawn points

Authors:

D. Haussler,

N. Littlestone,

M. K. WarmuthAuthors Info & Claims

Information and Computation, Volume 115, Issue 2

Pages 248 - 292

https://doi.org/10.1006/inco.1994.1097

Published: 01 December 1994 Publication History

Abstract

No abstract available.

Cited By

View all

Xiong PTegegn MSarin JPal SRubin J(2024)It Is All about Data: A Survey on the Effects of Data on Adversarial RobustnessACM Computing Surveys10.1145/362781756:7(1-41)Online publication date: 9-Apr-2024
https://dl.acm.org/doi/10.1145/3627817
Attias IHanneke SKalavasis AKarbasi AVelegkas GOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)Optimal learners for realizable regressionProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3668058(44707-44739)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3668058
Brukhim NDaniely AMansour YMoran SOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)Multiclass boostingProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3666192(1403-1425)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3666192
Show More Cited By

Index Terms

Predicting {0, 1}-functions on randomly drawn points
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Design and analysis of algorithms
  2. Models of computation
    1. Probabilistic computation

Recommendations

A unified framework of 0-overlap functions and 1-grouping functions
Abstract
Overlap and grouping functions have been studied by many scholars since they were proposed because of their successful application in various practical problems such as in image processing, decision-making, classifications etc.. At the ...
Highlights
- Concept of Θ − Ξ functions, as the unity of 0-overlap functions and 1-grouping functions, is introduced.
A characterization of bent functions on n + 1 variables
ISP'07: Proceedings of the 6th WSEAS international conference on Information security and privacy

In this paper we construct a Boolean function of n + 1 variables starting with two Boolean functions of n variables and we we introduce a necessary and sufficient condition in order to new function be a bent function when n is a positive odd integer.
Construction of 1-resilient boolean functions with very good nonlinearity
SETA'06: Proceedings of the 4th international conference on Sequences and Their Applications

In this paper we present a strategy to construct 1-resilient Boolean functions with very good nonlinearity and autocorrelation. Our strategy to construct a 1-resilient function is based on modifying a bent function, by toggling some of its output bits. ...

Comments

Information & Contributors

Information

Published In

Information and Computation Volume 115, Issue 2

Dec. 1994

193 pages

ISSN:0890-5401

Editor:
Albert R. Meyer
Massachusetts Institute of Technology, Cambridge

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 December 1994

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

61
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Xiong PTegegn MSarin JPal SRubin J(2024)It Is All about Data: A Survey on the Effects of Data on Adversarial RobustnessACM Computing Surveys10.1145/362781756:7(1-41)Online publication date: 9-Apr-2024
https://dl.acm.org/doi/10.1145/3627817
Attias IHanneke SKalavasis AKarbasi AVelegkas GOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)Optimal learners for realizable regressionProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3668058(44707-44739)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3668058
Brukhim NDaniely AMansour YMoran SOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)Multiclass boostingProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3666192(1403-1425)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3666192
Montasser OHanneke SSrebro NKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Adversarially robust learningProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3602985(37458-37470)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3602985
Hanneke SKarbasi AMahmoody MMehalel IMoran SKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)On optimal learning under targeted data poisoningProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3602501(30770-30782)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3602501
Hanneke SKarbasi AMoran SVelegkas GKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Universal rates for interactive learningProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3602347(28657-28669)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3602347
Attias IHanneke SMansour YKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)A characterization of semi-supervised adversarially robust PAC learnabilityProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3601988(23646-23659)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3601988
Kalavasis AVelegkas GKarbasi AKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Multiclass learnability beyond the PAC frameworkProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3601783(20809-20822)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3601783
Shao HMontasser OBlum AKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)A theory of PAC learnability under transformation invariancesProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3601287(13989-14001)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3601287
Rubinstein JRubinstein BKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Unlabelled sample compression schemes for intersection-closed classes and extremal classesProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3601220(13078-13090)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3601220
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

A unified framework of 0-overlap functions and 1-grouping functions

A characterization of bent functions on n + 1 variables

Construction of 1-resilient boolean functions with very good nonlinearity

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations