Yang Yu

According to our database1, Yang Yu authored at least 82 papers between 2005 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Running time analysis of the (1+1)-EA for robust linear optimization.
Theor. Comput. Sci., 2020

A technical view on neural architecture search.
Int. J. Mach. Learn. Cybern., 2020

Validation Set Evaluation can be Wrong: An Evaluator-Generator Approach for Maximizing Online Performance of Ranking in E-commerce.
CoRR, 2020

Reinforcement Learning with Action-Specific Focuses in Video Games.
Proceedings of the IEEE Conference on Games, 2020

An Efficient Evolutionary Algorithm for Subset Selection with General Cost Constraints.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Improving Fictitious Play Reinforcement Learning with Expanding Models.
CoRR, 2019

On the Robustness of Median Sampling in Noisy Evolutionary Optimization.
CoRR, 2019

Towards AutoML in the presence of Drift: first results.
CoRR, 2019

Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms.
Artif. Intell., 2019

Bridging Machine Learning and Logical Reasoning by Abductive Learning.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Reinforcement Learning Experience Reuse with Policy Residual Representation.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Cascaded Algorithm-Selection and Hyper-Parameter Optimization with Extreme-Region Upper Confidence Bound Bandit.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Asynchronous classification-based optimization.
Proceedings of the First International Conference on Distributed Artificial Intelligence, 2019

Virtual-Taobao: Virtualizing Real-World Online Retail Environment for Reinforcement Learning.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Multi-Fidelity Automatic Hyper-Parameter Tuning via Transfer Series Expansion.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Evolutionary Learning: Advances in Theories and Algorithms
Springer, ISBN: 978-981-13-5955-2, 2019

2018
Reusable Reinforcement Learning via Shallow Trails.
IEEE Trans. Neural Networks Learn. Syst., 2018

Analyzing Evolutionary Optimization in Noisy Environments.
Evol. Comput., 2018

On the Effectiveness of Sampling for Evolutionary Optimization in Noisy Environments.
Evol. Comput., 2018

Taking Human out of Learning Applications: A Survey on Automated Machine Learning.
CoRR, 2018

Accelerating E-Commerce Search Engine Ranking by Contextual Factor Selection.
CoRR, 2018

Tunneling Neural Perception and Logic Reasoning through Abductive Learning.
CoRR, 2018

ZOOpt/ZOOjl: Toolbox for Derivative-Free Optimization.
CoRR, 2018

Multi-Layered Gradient Boosting Decision Trees.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Reinforcement Learning to Rank in E-Commerce Search Engine: Formalization, Analysis, and Application.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Stabilizing Reinforcement Learning in Dynamic Environment with Application to Online Recommendation.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Learning Environmental Calibration Actions for Policy Self-Evolution.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Towards Sample Efficient Reinforcement Learning.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Experienced Optimization with Reusable Directional Model for Hyper-Parameter Search.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Analysis of noisy evolutionary optimization when sampling fails.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Noisy Derivative-Free Optimization With Value Suppression.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Maximizing Non-monotone/Non-submodular Functions by Multi-objective Evolutionary Algorithms.
CoRR, 2017

Subset Selection under Noise.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Binary Linear Compression for Multi-label Classification.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

AGRA: An Analysis-Generation-Ranking Framework for Automatic Abbreviation from Paper Titles.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Open Category Classification by Adversarial Sample Generation.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Life-Stage Modeling by Customer-Manifold Embedding.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Optimizing Ratio of Monotone Set Functions.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On Subset Selection with General Cost Constraints.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Evolutionary multi-objective optimization made faster by sequential decomposition.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

Solving High-Dimensional Multi-Objective Optimization Problems with Low Effective Dimensions.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Sequential Classification-Based Optimization for Direct Policy Search.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Parallel Pareto Optimization for Subset Selection.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Derivative-Free Optimization of High-Dimensional Non-Convex Functions by Sequential Random Embeddings.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

A Lower Bound Analysis of Population-Based Evolutionary Algorithms for Pseudo-Boolean Functions.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2016, 2016

Boosting Nonparametric Policies.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Derivative-Free Optimization via Classification.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Scaling Simultaneous Optimistic Optimization for High-Dimensional Non-Convex Functions with Low Effective Dimensions.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Switch Analysis for Running Time Analysis of Evolutionary Algorithms.
IEEE Trans. Evol. Comput., 2015

A two-layer surrogate-assisted particle swarm optimization algorithm.
Soft Comput., 2015

Variable solution structure can be helpful in evolutionary optimization.
Sci. China Inf. Sci., 2015

Subset Selection by Pareto Optimization.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

On Constrained Boolean Pareto Optimization.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Running time analysis: Convergence-based analysis reduces to switch analysis.
Proceedings of the IEEE Congress on Evolutionary Computation, 2015

Pareto Ensemble Pruning.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
On the Effectiveness of Sampling for Evolutionary Optimization in Noisy Environments.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

Napping for functional representation of policy.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Learning with Augmented Class by Exploiting Unlabeled Data.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
An analysis on recombination in multi-objective evolutionary optimization.
Artif. Intell., 2013

Self-Practice Imitation Learning from Weak Policy.
Proceedings of the Partially Supervised Learning - Second IAPR International Workshop, 2013

On the Approximation Ability of Evolutionary Optimization with Application to Minimum Set Cover: Extended Abstract.
Proceedings of the IJCAI 2013, 2013

2012
On the approximation ability of evolutionary optimization with application to minimum set cover.
Artif. Intell., 2012

On Algorithm-Dependent Boundary Case Identification for Problem Classes.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

Diversity Regularized Ensemble Pruning.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

Multi-label hypothesis reuse.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

2011
Towards Analyzing Crossover Operators in Evolutionary Search via General Markov Chain Switching Theorem
CoRR, 2011

Diversity Regularized Machine.
Proceedings of the IJCAI 2011, 2011

Lifted-Rollout for Approximate Policy Iteration of Markov Decision Process.
Proceedings of the Data Mining Workshops (ICDMW), 2011

Collisions are helpful for computing unique input-output sequences.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

2010
A framework for modeling positive class expansion with single snapshot.
Knowl. Inf. Syst., 2010

Evolutionary Algorithms as Guaranteed Approximation Optimizers
CoRR, 2010

Towards Analyzing Recombination Operators in Evolutionary Search.
Proceedings of the Parallel Problem Solving from Nature, 2010

2009
Semi-naive Exploitation of One-Dependence Estimators.
Proceedings of the ICDM 2009, 2009

2008
Spectrum of Variable-Random Trees.
J. Artif. Intell. Res., 2008

A new approach to estimating the expected first hitting time of evolutionary algorithms.
Artif. Intell., 2008

TEFE: A Time-Efficient Approach to Feature Extraction.
Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

On the usefulness of infeasible solutions in evolutionary search: A theoretical study.
Proceedings of the IEEE Congress on Evolutionary Computation, 2008

2007
Predicting Future Customers via Ensembling Gradually Expanded Trees.
Int. J. Data Warehous. Min., 2007

Cocktail Ensemble for Regression.
Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), 2007

2005
Ensembling local learners ThroughMultimodal perturbation.
IEEE Trans. Syst. Man Cybern. Part B, 2005

Adapt Bagging to Nearest Neighbor Classifiers.
J. Comput. Sci. Technol., 2005


  Loading...