dynamic programming

Why Non-myopic Bayesian Optimization is Promising and How Far Should We Look-ahead? A Study via Rollout AISTATS 2020 A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation NeurIPS 2019 An Imperfect Algorithm for Coalition Structure Generation AAAI 2019 Connectionist Temporal Modeling of Video and Language: a Joint Model for Translation and Sign Labeling IJCAI 2019 Counting Complexity for Reasoning in Abstract Argumentation AAAI 2019 Exact Bernoulli Scan Statistics using Binary Decision Diagrams IJCAI 2019 Generalized Maximum Entropy Estimation JMLR 2019 Homomorphic Sensing ICML 2019 Interpretable Almost-Exact Matching for Causal Inference AISTATS 2019 Kernels for Sequentially Ordered Data JMLR 2019 Label-Agnostic Sequence Labeling by Copying Nearest Neighbors ACL 2019 Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions IJCAI 2019 Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms NeurIPS 2019 Optimal Completion Distillation for Sequence Learning ICLR 2019 Optimizing Constraint Solving via Dynamic Programming IJCAI 2019 Separator-Based Pruned Dynamic Programming for Steiner Tree AAAI 2019 Sequential Facility Location: Approximate Submodularity and Greedy Algorithm ICML 2019 Split or Merge: Which is Better for Unsupervised RST Parsing? EMNLP 2019 Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy Policies NeurIPS 2019 VidyutVanika: A Reinforcement Learning Based Broker Agent for a Power Trading Competition AAAI 2019 An Efficient Pruning Algorithm for Robust Isotonic Regression NeurIPS 2018 Boosting Dynamic Programming with Neural Networks for Solving NP-hard Problems ACML 2018 Compact Representation of Uncertainty in Clustering NeurIPS 2018 Complexity of Scheduling Charging in the Smart Grid IJCAI 2018 Connectionist Temporal Classification with Maximum Entropy Regularization NeurIPS 2018