Ke Tang

Approximation to Smooth Functions by Low-Rank Swish Networks ICML 2025 Binarized Mamba-Transformer for Lightweight Quad Bayer HybridEVS Demosaicing CVPR 2025 Efficient Robustness Evaluation via Constraint Relaxation AAAI 2025 Expensive Multi-Objective Bayesian Optimization Based on Diffusion Models AAAI 2025 Mitigating Catastrophic Overfitting in Fast Adversarial Training via Label Information Elimination ICCV 2025 Safe Delta: Consistently Preserving Safety when Fine-Tuning LLMs on Diverse Datasets ICML 2025 SOO-Bench: Benchmarks for Evaluating the Stability of Offline Black-Box Optimization ICLR 2025 Agent-Pro: Learning to Evolve via Policy-Level Reflection and Optimization ACL 2024 DPN: Decoupling Partition and Navigation for Neural Solvers of Min-max Vehicle Routing Problems ICML 2024 Reliable Robustness Evaluation via Automatically Constructed Attack Ensembles AAAI 2023 Causality-driven Hierarchical Structure Discovery for Reinforcement Learning NeurIPS 2022 Generalization Performance of Multi-pass Stochastic Gradient Descent with Convex Loss Functions JMLR 2021 Towards Robust Dynamic Network Embedding IJCAI 2021 On Performance Estimation in Automatic Algorithm Configuration AAAI 2020 Automatic Construction of Parallel Portfolios via Explicit Instance Grouping AAAI 2019 Explicit Planning for Efficient Exploration in Reinforcement Learning NeurIPS 2019 Optimal Stochastic and Online Learning with Individual Iterates NeurIPS 2019 Unsupervised Feature Selection by Pareto Optimization AAAI 2019 A General Approach to Running Time Analysis of Multi-objective Evolutionary Algorithms IJCAI 2018 Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection IJCAI 2018 Distributed Pareto Optimization for Subset Selection IJCAI 2018 Efficient DNN Neuron Pruning by Minimizing Layer-wise Nonlinear Reconstruction Error IJCAI 2018 Generalization Bounds for Regularized Pairwise Learning IJCAI 2018 Optimization based Layer-wise Magnitude-based Pruning for DNN Compression IJCAI 2018 Sequence Selection by Pareto Optimization IJCAI 2018 Stochastic Composite Mirror Descent: Optimal Bounds with High Probabilities NeurIPS 2018 Log-normality and Skewness of Estimated State/Action Values in Reinforcement Learning NeurIPS 2017 On Subset Selection with General Cost Constraints IJCAI 2017 Optimizing Ratio of Monotone Set Functions IJCAI 2017 Subset Selection under Noise NeurIPS 2017 Parallel Pareto Optimization for Subset Selection IJCAI 2016 Active Learning from Crowds with Unsure Option IJCAI 2015 Increasingly Cautious Optimism for Practical PAC-MDP Exploration IJCAI 2015