On The "Majority is Least Stable" Conjecture

02/18/2022
by   Aniruddha Biswas, et al.
0

We show that the "majority is least stable" conjecture is true for n=1 and 3 and false for all odd n≥ 5.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/07/2020

The Langberg-Médard Multiple Unicast Conjecture: Stable 3-Pair Networks

The Langberg-Médard multiple unicast conjecture claims that for a strong...
research
08/17/2021

A Note on the Permuted Puzzles Toy Conjecture

In this note, we show that a "Toy Conjecture" made by (Boyle, Ishai, Pas...
research
06/04/2019

What do AI algorithms actually learn? - On false structures in deep learning

There are two big unsolved mathematical questions in artificial intellig...
research
08/04/2021

The Gotsman-Linial Conjecture is False

In 1991, Craig Gotsman and Nathan Linial conjectured that for all n and ...
research
11/16/2021

On Bock's Conjecture Regarding the Adam Optimizer

In 2014, Kingma and Ba published their Adam optimizer algorithm, togethe...
research
06/04/2016

Distance Metric Ensemble Learning and the Andrews-Curtis Conjecture

Motivated by the search for a counterexample to the Poincaré conjecture ...
research
07/24/2013

When is the majority-vote classifier beneficial?

In his seminal work, Schapire (1990) proved that weak classifiers could ...

Please sign up or login with your details

Forgot password? Click here to reset