Search Results for author: Xuan Wu

Found 8 papers, 2 papers with code

Coresets for Clustering in Graphs of Bounded Treewidth

no code implementations ICML 2020 Daniel Baker, Vladimir Braverman, Lingxiao Huang, Shaofeng H. -C. Jiang, Robert Krauthgamer, Xuan Wu

We initiate the study of coresets for clustering in graph metrics, i. e., the shortest-path metric of edge-weighted graphs.

Data Visualization

Surprisingly Popular Algorithm-based Adaptive Euclidean Distance Topology Learning PSO

no code implementations25 Aug 2021 Xuan Wu, Jizong Han, Quanlong Cui, Liang Chen, Yanchun Liang, Han Huang, Heow Pueh Lee, You Zhou, Chunguo Wu

And then we propose the Surprisingly Popular Algorithm-based Adaptive Euclidean Distance Topology Learning Particle Swarm Optimization (SpadePSO), which uses SPA to guide the search direction of the exploitation sub-population, and analyze the influence of different topologies on SPA.

Neural Architecture Search based on Cartesian Genetic Programming Coding Method

no code implementations12 Mar 2021 Xuan Wu, Linhan Jia, Xiuyi Zhang, Liang Chen, Yanchun Liang, You Zhou, Chunguo Wu

To evolve the architectures under the framework of CGP, the operations such as convolution are identified as the types of function nodes of CGP, and the evolutionary operations are designed based on Evolutionary Strategy.

Neural Architecture Search Sentence Classification

Coresets for Gaussian Mixture Models of Any Shape

no code implementations12 Jun 2019 Dan Feldman, Zahi Kfir, Xuan Wu

For example, for any input set $D$ whose coordinates are integers in $[-n^{100}, n^{100}]$ and any fixed $k, d\geq 1$, the coreset size is $(\log n)^{O(1)}/\varepsilon^2$, and can be computed in time near-linear in $n$, with high probability.

Coresets for Ordered Weighted Clustering

1 code implementation11 Mar 2019 Vladimir Braverman, Shaofeng H. -C. Jiang, Robert Krauthgamer, Xuan Wu

We design coresets for Ordered k-Median, a generalization of classical clustering problems such as k-Median and k-Center, that offers a more flexible data analysis, like easily combining multiple objectives (e. g., to increase fairness or for Pareto optimization).

Data Structures and Algorithms

Wasserstein Identity Testing

no code implementations28 Oct 2017 Shichuan Deng, Wenzheng Li, Xuan Wu

In this paper, we propose the Wasserstein identity testing problem (Identity Testing in Wasserstein distance).

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