Search Results for author: Kaile Su

Found 8 papers, 2 papers with code

Dropout with Tabu Strategy for Regularizing Deep Neural Networks

no code implementations29 Aug 2018 Zongjie Ma, Abdul Sattar, Jun Zhou, Qingliang Chen, Kaile Su

Tabu Dropout has no extra parameters compared with the standard Dropout and also it is computationally cheap.

Advancing Tabu and Restart in Local Search for Maximum Weight Cliques

no code implementations22 Apr 2018 Yi Fan, Nan Li, Chengqian Li, Zongjie Ma, Longin Jan Latecki, Kaile Su

Our new restart strategy is based on the re-occurrence of a local search scenario instead of that of a candidate solution.

Trainable back-propagated functional transfer matrices

1 code implementation28 Oct 2017 Cheng-Hao Cai, Yanyan Xu, Dengfeng Ke, Kaile Su, Jing Sun

In experiments, it is demonstrated that the revised rules can be used to train a range of functional connections: 20 different functions are applied to neural networks with up to 10 hidden layers, and most of them gain high test accuracies on the MNIST database.

Learning of Human-like Algebraic Reasoning Using Deep Feedforward Neural Networks

no code implementations25 Apr 2017 Cheng-Hao Cai, Dengfeng Ke, Yanyan Xu, Kaile Su

Briefly, in a reasoning system, a deep feedforward neural network is used to guide rewriting processes after learning from algebraic reasoning examples produced by humans.

Normative Multiagent Systems: A Dynamic Generalization

no code implementations18 Apr 2016 Xiaowei Huang, Ji Ruan, Qingliang Chen, Kaile Su

Social norms are powerful formalism in coordinating autonomous agents' behaviour to achieve certain objectives.

NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover

no code implementations4 Feb 2014 Shaowei Cai, Kaile Su, Chuan Luo, Abdul Sattar

These two strategies are used in designing a new MVC local search algorithm, which is referred to as NuMVC.

Combinatorial Optimization

Variable Forgetting in Reasoning about Knowledge

no code implementations15 Jan 2014 Kaile Su, Abdul Sattar, Guanfeng Lv, Yan Zhang

Given a background knowledge base and a set of observable variables for each agent, we show that the notion of an agent knowing a formula can be defined as a weakest sufficient condition of the formula under background knowledge base.

Cannot find the paper you are looking for? You can Submit a new open access paper.