Bandmaxsat: A local search MaxSAT solver with multi-armed bandit
We address Partial MaxSAT (PMS) and Weighted PMS (WPMS), two practical
generalizations of the MaxSAT problem, and propose a local search algorithm for these …
generalizations of the MaxSAT problem, and propose a local search algorithm for these …
Integrating multi-armed bandit with local search for MaxSAT
Abstract Partial MaxSAT (PMS) and Weighted PMS (WPMS) are two practical
generalizations of the MaxSAT problem. In this paper, we introduce a new local search …
generalizations of the MaxSAT problem. In this paper, we introduce a new local search …
Interactive anomaly detection in dynamic communication networks
Network flows are the basic components of the Internet. Considering the serious
consequences of abnormal flows, it is crucial to provide timely anomaly detection in dynamic …
consequences of abnormal flows, it is crucial to provide timely anomaly detection in dynamic …
[PDF][PDF] A practical semi-parametric contextual bandit.
Classic multi-armed bandit algorithms are inefficient for a large number of arms. On the other
hand, contextual bandit algorithms are more efficient, but they suffer from a large regret due …
hand, contextual bandit algorithms are more efficient, but they suffer from a large regret due …
Zero-Inflated Bandits
Many real applications of bandits have sparse non-zero rewards, leading to slow learning
rates. A careful distribution modeling that utilizes problem-specific structures is known as …
rates. A careful distribution modeling that utilizes problem-specific structures is known as …
Incorporating Multi-armed Bandit with Local Search for MaxSAT
Partial MaxSAT (PMS) and Weighted PMS (WPMS) are two practical generalizations of the
MaxSAT problem. In this paper, we propose a local search algorithm for these problems …
MaxSAT problem. In this paper, we propose a local search algorithm for these problems …