5 citations · 7 across the 8 of their papers we have counts for
8 papers
Geometry-Biased Transformer for Robust Multi-View 3D Human Pose Reconstruction
Olivier Moliner, Sangxia Huang, Kalle Åström
We address the challenges in estimating 3D human poses from multiple views under occlusion and with limited overlapping views. We approach multi-view, single-person 3D human pose r…
Bootstrapped Representation Learning for Skeleton-Based Action Recognition
Olivier Moliner, Sangxia Huang, Kalle Åström
In this work, we study self-supervised representation learning for 3D skeleton-based action recognition. We extend Bootstrap Your Own Latent (BYOL) for representation learning on s…
Adversarial Attacks and Defences Competition
Alexey Kurakin, Ian Goodfellow, Samy Bengio +20
To accelerate research on adversarial examples and robustness of machine learning classifiers, Google Brain organized a NIPS 2017 competition that encouraged researchers to develop…
Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering
Buddhima Gamlath, Sangxia Huang, Ola Svensson
We study -means clustering in a semi-supervised setting. Given an oracle that returns whether two given points belong to the same cluster in a fixed optimal clustering, we inves…
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
Abbas Bazzi, Samuel Fiorini, Sangxia Huang +1
Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of cover…
Hardness for Hypergraph Coloring
Sangxia Huang
We show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with colors, where is the number of vertices. There has been much focus o…
Improved Hardness of Approximating Chromatic Number
Sangxia Huang
We prove that for sufficiently large K, it is NP-hard to color K-colorable graphs with less than 2^{K^{1/3}} colors. This improves the previous result of K versus K^{O(log K)} in K…
From Holant To #CSP And Back: Dichotomy For Holant Problems
Jin-Yi Cai, Sangxia Huang, Pinyan Lu
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color…