Can Compact Optimisation Algorithms Be Structurally Biased?
Anna V. KononovaFabio CaraffiniHao WangThomas BäckPublished in: PPSN (1) (2020)
Keyphrases
- theoretical analysis
- significant improvement
- learning algorithm
- computational cost
- database
- times faster
- combinatorial optimization
- data structure
- optimization problems
- computationally efficient
- efficient implementation
- recently developed
- computationally expensive
- computational efficiency
- orders of magnitude
- high dimensional
- lower bound
- computational complexity
- optimal solution
- multiscale
- computer vision
- information retrieval
- real time