Co-occurring keywords · papers mentioning both
Papers
What Can We Learn Even from the Weakest? Learning Sketches for Programmatic Strategies
AAAI 2022
BESA: BERT-based Simulated Annealing for Adversarial Text Attacks
IJCAI 2021
Learning Complexity of Simulated Annealing
AISTATS 2021
Towards Understanding the Behaviors of Optimal Deep Active Learning Algorithms
AISTATS 2021
Learning Optimal Temperature Region for Solving Mixed Integer Functional DCOPs
IJCAI 2020
Neural Gibbs Sampling for Joint Event Argument Extraction
AACL 2020
Unsupervised Paraphrasing by Simulated Annealing
ACL 2020
Unsupervised Text Generation by Learning from Search
NeurIPS 2020
Canonical Soft Time Warping
ACML 2019
Convergence Rate of a Simulated Annealing Algorithm with Noisy Observations
JMLR 2019
DynTypo: Example-Based Dynamic Text Effects Transfer
CVPR 2019
Sample Efficient Graph-Based Optimization with Noisy Observations
AISTATS 2019
Sampling and Optimization on Convex Sets in Riemannian Manifolds of Non-Negative Curvature
COLT 2019
Convex Optimization with Unbounded Nonconvex Oracles using Simulated Annealing
COLT 2018
A Simulated Annealing Based Inexact Oracle for Wasserstein Loss Minimization
ICML 2017
Identifying a Minimal Class of Models for High--dimensional Data
JMLR 2017
Metaheuristic Approaches to Lexical Substitution and Simplification
EACL 2017
Bridging the Gap between Stochastic Gradient MCMC and Stochastic Optimization
AISTATS 2016
Faster Convex Optimization: Simulated Annealing with an Efficient Universal Barrier
ICML 2016
Learning Using Anti-Training with Sacrificial Data
JMLR 2016
Noisy Activation Functions
ICML 2016
Scalable MAP inference in Bayesian networks based on a Map-Reduce approach
PGM 2016
Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions
COLT 2015
Scaling Nonparametric Bayesian Inference via Subsample-Annealing
AISTATS 2014
Clustering Aggregation as Maximum-Weight Independent Set
NeurIPS 2012