Phase transition in the knapsack problem

06/26/2018
by   Nitin Yadav, et al.
0

We examine the phase transition phenomenon for the Knapsack problem from both a computational and a human perspective. We first provide, via an empirical and a theoretical analysis, a characterization of the phenomenon in terms of two instance properties; normalised capacity and normalised profit. Then, we show evidence that average time spent by human decision makers in solving an instance peaks near the phase transition. Given the ubiquity of the Knapsack problem in every-day life, a better understanding of its structure can improve our understanding not only of computational techniques but also of human behavior, including the use and development of heuristics and occurrence of biases.

READ FULL TEXT
research
10/12/2011

Phase Transition for Random Quantified XOR-Formulas

The QXORSAT problem is the quantified version of the satisfiability prob...
research
06/22/2011

An Analysis of Phase Transition in NK Landscapes

In this paper, we analyze the decision version of the NK landscape model...
research
03/28/2014

Difficulty Rating of Sudoku Puzzles: An Overview and Evaluation

How can we predict the difficulty of a Sudoku puzzle? We give an overvie...
research
06/10/2022

The Slingshot Mechanism: An Empirical Study of Adaptive Optimizers and the Grokking Phenomenon

The grokking phenomenon as reported by Power et al. ( arXiv:2201.02177 )...
research
07/17/2019

Learnability for the Information Bottleneck

The Information Bottleneck (IB) method (tishby2000information) provides ...
research
03/21/2023

A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks

Grokking is a phenomenon where a model trained on an algorithmic task fi...
research
12/02/2021

Trap of Feature Diversity in the Learning of MLPs

In this paper, we discover a two-phase phenomenon in the learning of mul...

Please sign up or login with your details

Forgot password? Click here to reset