The epsilon-subdifferential of convex univariate piecewise linear-quadratic (PLQ) functions can be computed in linear worst-case time complexity as the level-set of a convex function. Using binary search, we improve the complexity to logarithmic worst-case time, and prove such complexity is optimal...
Worst-Case Disjunctive Search.Our first solution, which we call IEX, is a worst-case sub-linear disjunctive SSE scheme. While it leaks more than the naive response-hiding solution, we stress that it achievesoptimalcommunication complexity which, for response-hiding schemes, is the main tradeoff w...
to Analyze Algorithm Performance Based on the Worst-case Instances - Jeon, Kim - 2010 () Citation Context ...emert [8] tried to find the worst case of some algorithms for binary constraint satisfaction, Boolean satisfiability, and the travelling salesperson problem, in terms of time complexity....
We present a worst case decoding problem whose hardness reduces to that of solving the Learning Parity with Noise (LPN) problem, in some parameter regime. Prior to this work, no worst case hardness result was known for LPN (as opposed to syntactically similar problems such as Learning with Er...
And then after all this, we're hit with just about the most standard ternary search question in existence? It's not even funny at this point, it's just embarrassing. Rant over. I hope those who deserved rating got it. In a perfect world, low-quality contests like this wouldn’t happe...
Due to the computational complexity, only the special case of leave-1-out is widely used [8, 11, 12]. Commonly used non-exhaustive cross validation criteria include m-fold [13, 14], holdout [15], random sampling [16], etc. It is worth mentioning that leave-k-out is the exhaustive ...
Moreover, the interior point methods used to solve the LMI depend on the initial solution and the time needed to converge is not always the same. We consider in this paper linear systems with bounded additive uncertainties and a quadratic criterion. In this case, computing the worst case cost...
The caveat is that this worst case problem is only mildly hard and in particular admits a quasi-polynomial time algorithm, whereas the LPN variant used in the reduction requires extremely high noise rate of 1 2 ? 1 pol y ( n ) . Thus we can only show that ``very hard'' LPN is ...
to Analyze Algorithm Performance Based on the Worst-case Instances - Jeon, Kim - 2010 () Citation Context ...emert [8] tried to find the worst case of some algorithms for binary constraint satisfaction, Boolean satisfiability, and the travelling salesperson problem, in terms of time complexity....
Prior to this work, no worst case hardness result was known for LPN (as opposed to syntactically similar problems such as Learning with Errors). The caveat is that this worst case problem is only mildly hard and in particular admits a quasi-polynomial time algorithm, whereas the LPN variant ...