Search Results for author: Yihong Wu

Found 52 papers, 8 papers with code

Spectral Graph Matching and Regularized Quadratic Relaxations: Algorithm and Theory

no code implementations ICML 2020 Zhou Fan, Cheng Mao, Yihong Wu, Jiaming Xu

Graph matching, also known as network alignment, aims at recovering the latent vertex correspondence between two unlabeled, edge-correlated weighted graphs.

Computational Efficiency Graph Matching

Optimal score estimation via empirical Bayes smoothing

no code implementations12 Feb 2024 Andre Wibisono, Yihong Wu, Kaylee Yingxi Yang

We study the problem of estimating the score function of an unknown probability distribution $\rho^*$ from $n$ independent and identically distributed observations in $d$ dimensions.

Depth Insight -- Contribution of Different Features to Indoor Single-image Depth Estimation

no code implementations16 Nov 2023 Yihong Wu, Yuwen Heng, Mahesan Niranjan, Hansung Kim

To this end, in this work, we quantify the relative contributions of the known cues of depth in a monocular depth estimation setting using an indoor scene data set.

Edge Detection Monocular Depth Estimation

Collaboration and Transition: Distilling Item Transitions into Multi-Query Self-Attention for Sequential Recommendation

1 code implementation2 Nov 2023 Tianyu Zhu, Yansong Shi, Yuan Zhang, Yihong Wu, Fengran Mo, Jian-Yun Nie

Second, we develop a transition-aware embedding distillation module that distills global item-to-item transition patterns into item embeddings, which enables the model to memorize and leverage transitional signals and serves as a calibrator for collaborative signals.

Sequential Recommendation

MoqaGPT : Zero-Shot Multi-modal Open-domain Question Answering with Large Language Model

1 code implementation20 Oct 2023 Le Zhang, Yihong Wu, Fengran Mo, Jian-Yun Nie, Aishwarya Agrawal

To enable LLMs to tackle the task in a zero-shot manner, we introduce MoqaGPT, a straightforward and flexible framework.

Language Modelling Large Language Model +2

MatSpectNet: Material Segmentation Network with Domain-Aware and Physically-Constrained Hyperspectral Reconstruction

1 code implementation21 Jul 2023 Yuwen Heng, Yihong Wu, Jiawen Chen, Srinandan Dasmahapatra, Hansung Kim

The network leverages the principles of colour perception in modern cameras to constrain the reconstructed hyperspectral images and employs the domain adaptation method to generalise the hyperspectral reconstruction capability from a spectral recovery dataset to material segmentation datasets.

Domain Adaptation Segmentation

ConvGQR: Generative Query Reformulation for Conversational Search

1 code implementation25 May 2023 Fengran Mo, Kelong Mao, Yutao Zhu, Yihong Wu, Kaiyu Huang, Jian-Yun Nie

In this paper, we propose ConvGQR, a new framework to reformulate conversational queries based on generative pre-trained language models (PLMs), one for query rewriting and another for generating potential answers.

Conversational Search Retrieval

All-condition pulse detection using a magnetic sensor

no code implementations19 Apr 2023 Haoxuan Shen, Xiaoyi Gu, Yihong Wu

A plethora of wearable devices have been developed or commercialized for continuous non-invasive monitoring of physiological signals that are crucial for preventive care and management of chronic conditions.


NPR: Nocturnal Place Recognition in Streets

no code implementations1 Apr 2023 Bingxi Liu, Yujie Fu, Feng Lu, Jinqiang Cui, Yihong Wu, Hong Zhang

Then we used this model to process existing large-scale VPR datasets to generate the VPR-Night datasets and demonstrated how to combine them with two popular VPR pipelines.

Image-to-Image Translation Visual Place Recognition

Random graph matching at Otter's threshold via counting chandeliers

no code implementations25 Sep 2022 Cheng Mao, Yihong Wu, Jiaming Xu, Sophie H. Yu

We propose an efficient algorithm for graph matching based on similarity scores constructed from counting a certain family of weighted trees rooted at each vertex.

Graph Matching

Random Graph Matching in Geometric Models: the Case of Complete Graphs

no code implementations22 Feb 2022 Haoyu Wang, Yihong Wu, Jiaming Xu, Israel Yolou

This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching with independent edge weights to geometric models.

Graph Matching

Scale-Net: Learning to Reduce Scale Differences for Large-Scale Invariant Image Matching

no code implementations20 Dec 2021 Yujie Fu, Yihong Wu

To solve this problem, firstly, we propose a scale-difference-aware image matching method (SDAIM) that reduces image scale differences before local feature extraction, via resizing both images of an image pair according to an estimated scale ratio.

Pose Estimation

Testing network correlation efficiently via counting trees

no code implementations22 Oct 2021 Cheng Mao, Yihong Wu, Jiaming Xu, Sophie H. Yu

We propose a new procedure for testing whether two networks are edge-correlated through some latent vertex correspondence.


Sharp regret bounds for empirical Bayes and compound decision problems

no code implementations8 Sep 2021 Yury Polyanskiy, Yihong Wu

We show that for the Poisson model with compactly supported and subexponential priors, the optimal regret scales as $\Theta((\frac{\log n}{\log\log n})^2)$ and $\Theta(\log^3 n)$, respectively, both attained by the original estimator of Robbins.

Density Estimation

The planted matching problem: Sharp threshold and infinite-order phase transition

no code implementations17 Mar 2021 Jian Ding, Yihong Wu, Jiaming Xu, Dana Yang

Conversely, if $\sqrt{d} B(\mathcal{P},\mathcal{Q}) \ge 1+\epsilon$ for an arbitrarily small constant $\epsilon>0$, the reconstruction error for any estimator is shown to be bounded away from $0$ under both the sparse and dense model, resolving the conjecture in [Moharrami et al. 2019, Semerjian et al. 2020].

Settling the Sharp Reconstruction Thresholds of Random Graph Matching

no code implementations29 Jan 2021 Yihong Wu, Jiaming Xu, Sophie H. Yu

This paper studies the problem of recovering the hidden vertex correspondence between two edge-correlated random graphs.

Graph Matching

EventAnchor: Reducing Human Interactions in Event Annotation of Racket Sports Videos

no code implementations13 Jan 2021 Dazhen Deng, Jiang Wu, Jiachen Wang, Yihong Wu, Xiao Xie, Zheng Zhou, HUI ZHANG, Xiaolong Zhang, Yingcai Wu

The popularity of racket sports (e. g., tennis and table tennis) leads to high demands for data analysis, such as notational analysis, on player performance.

Semi-Global Shape-aware Network

no code implementations17 Dec 2020 Pengju Zhang, Yihong Wu, Jiagang Zhu

In this paper, we propose a Semi-Global Shape-aware Network (SGSNet) considering both feature similarity and proximity for preserving object shapes when modeling long-range dependencies.

Image Retrieval Position +2

Leveraging Local and Global Descriptors in Parallel to Search Correspondences for Visual Localization

no code implementations23 Sep 2020 Pengju Zhang, Yihong Wu, Bingxi Liu

Each of the 2D image points is also called a query local feature when performing the 2D-3D point correspondences.

Binarization Image Retrieval +2

Learning Mixtures of Permutations: Groups of Pairwise Comparisons and Combinatorial Method of Moments

no code implementations14 Sep 2020 Cheng Mao, Yihong Wu

In applications such as rank aggregation, mixture models for permutations are frequently used when the population exhibits heterogeneity.

Testing correlation of unlabeled random graphs

no code implementations23 Aug 2020 Yihong Wu, Jiaming Xu, Sophie H. Yu

We study the problem of detecting the edge correlation between two random graphs with $n$ unlabeled nodes.

Two-sample testing

Self-regularizing Property of Nonparametric Maximum Likelihood Estimator in Mixture Models

no code implementations19 Aug 2020 Yury Polyanskiy, Yihong Wu

Notably, any such Gaussian mixture is statistically indistinguishable from a finite one with $O(\log n)$ components (and this is tight for certain mixtures).

Model Selection

VisImages: A Fine-Grained Expert-Annotated Visualization Dataset

no code implementations9 Jul 2020 Dazhen Deng, Yihong Wu, Xinhuan Shu, Jiang Wu, Siwei Fu, Weiwei Cui, Yingcai Wu

Images in visualization publications contain rich information, e. g., novel visualization designs and implicit design patterns of visualizations.


Extrapolating the profile of a finite population

no code implementations21 May 2020 Soham Jana, Yury Polyanskiy, Yihong Wu

Nevertheless, we show that in the sublinear regime of $m =\omega(k/\log k)$, it is possible to consistently estimate in total variation the \emph{profile} of the population, defined as the empirical distribution of the sizes of each type, which determines many symmetric properties of the population.

Optimal estimation of high-dimensional location Gaussian mixtures

no code implementations14 Feb 2020 Natalie Doss, Yihong Wu, Pengkun Yang, Harrison H. Zhou

This paper studies the optimal rate of estimation in a finite Gaussian location mixture model in high dimensions without separation conditions.

Vocal Bursts Intensity Prediction

Consistent recovery threshold of hidden nearest neighbor graphs

no code implementations18 Nov 2019 Jian Ding, Yihong Wu, Jiaming Xu, Dana Yang

Motivated by applications such as discovering strong ties in social networks and assembling genome subsequences in biology, we study the problem of recovering a hidden $2k$-nearest neighbor (NN) graph in an $n$-vertex complete graph, whose edge weights are independent and distributed according to $P_n$ for edges in the hidden $2k$-NN graph and $Q_n$ otherwise.

Randomly initialized EM algorithm for two-component Gaussian mixture achieves near optimality in $O(\sqrt{n})$ iterations

no code implementations28 Aug 2019 Yihong Wu, Harrison H. Zhou

We analyze the classical EM algorithm for parameter estimation in the symmetric two-component Gaussian mixtures in $d$ dimensions.

Spectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality

no code implementations20 Jul 2019 Zhou Fan, Cheng Mao, Yihong Wu, Jiaming Xu

We analyze a new spectral graph matching algorithm, GRAph Matching by Pairwise eigen-Alignments (GRAMPA), for recovering the latent vertex correspondence between two unlabeled, edge-correlated weighted graphs.

Graph Matching

Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model

no code implementations20 Jul 2019 Zhou Fan, Cheng Mao, Yihong Wu, Jiaming Xu

Departing from prior spectral approaches that only compare top eigenvectors, or eigenvectors of the same order, GRAMPA first constructs a similarity matrix as a weighted sum of outer products between all pairs of eigenvectors of the two graphs, with weights given by a Cauchy kernel applied to the separation of the corresponding eigenvalues, then outputs a matching by a simple rounding procedure.

Computational Efficiency Graph Matching

Automatically Extract the Semi-transparent Motion-blurred Hand from a Single Image

no code implementations27 Jun 2019 Xiaomei Zhao, Yihong Wu

The proposed method separates the extraction task into two subtasks: alpha matte prediction and foreground prediction.

Video Editing

Data Amplification: A Unified and Competitive Approach to Property Estimation

no code implementations NeurIPS 2018 Yi Hao, Alon Orlitsky, Ananda T. Suresh, Yihong Wu

We design the first unified, linear-time, competitive, property estimator that for a wide class of properties and for all underlying distributions uses just $2n$ samples to achieve the performance attained by the empirical estimator with $n\sqrt{\log n}$ samples.

Efficient random graph matching via degree profiles

1 code implementation19 Nov 2018 Jian Ding, Zongming Ma, Yihong Wu, Jiaming Xu

This work develops an $\tilde{O}(n d^2+n^2)$-time algorithm which perfectly recovers the true vertex correspondence with high probability, provided that the average degree is at least $d = \Omega(\log^2 n)$ and the two graphs differ by at most $\delta = O( \log^{-2}(n) )$ fraction of edges.

Graph Matching

Identifying the Best Machine Learning Algorithms for Brain Tumor Segmentation, Progression Assessment, and Overall Survival Prediction in the BRATS Challenge

1 code implementation5 Nov 2018 Spyridon Bakas, Mauricio Reyes, Andras Jakab, Stefan Bauer, Markus Rempfler, Alessandro Crimi, Russell Takeshi Shinohara, Christoph Berger, Sung Min Ha, Martin Rozycki, Marcel Prastawa, Esther Alberts, Jana Lipkova, John Freymann, Justin Kirby, Michel Bilello, Hassan Fathallah-Shaykh, Roland Wiest, Jan Kirschke, Benedikt Wiestler, Rivka Colen, Aikaterini Kotrotsou, Pamela Lamontagne, Daniel Marcus, Mikhail Milchenko, Arash Nazeri, Marc-Andre Weber, Abhishek Mahajan, Ujjwal Baid, Elizabeth Gerstner, Dongjin Kwon, Gagan Acharya, Manu Agarwal, Mahbubul Alam, Alberto Albiol, Antonio Albiol, Francisco J. Albiol, Varghese Alex, Nigel Allinson, Pedro H. A. Amorim, Abhijit Amrutkar, Ganesh Anand, Simon Andermatt, Tal Arbel, Pablo Arbelaez, Aaron Avery, Muneeza Azmat, Pranjal B., W Bai, Subhashis Banerjee, Bill Barth, Thomas Batchelder, Kayhan Batmanghelich, Enzo Battistella, Andrew Beers, Mikhail Belyaev, Martin Bendszus, Eze Benson, Jose Bernal, Halandur Nagaraja Bharath, George Biros, Sotirios Bisdas, James Brown, Mariano Cabezas, Shilei Cao, Jorge M. Cardoso, Eric N Carver, Adrià Casamitjana, Laura Silvana Castillo, Marcel Catà, Philippe Cattin, Albert Cerigues, Vinicius S. Chagas, Siddhartha Chandra, Yi-Ju Chang, Shiyu Chang, Ken Chang, Joseph Chazalon, Shengcong Chen, Wei Chen, Jefferson W. Chen, Zhaolin Chen, Kun Cheng, Ahana Roy Choudhury, Roger Chylla, Albert Clérigues, Steven Colleman, Ramiro German Rodriguez Colmeiro, Marc Combalia, Anthony Costa, Xiaomeng Cui, Zhenzhen Dai, Lutao Dai, Laura Alexandra Daza, Eric Deutsch, Changxing Ding, Chao Dong, Shidu Dong, Wojciech Dudzik, Zach Eaton-Rosen, Gary Egan, Guilherme Escudero, Théo Estienne, Richard Everson, Jonathan Fabrizio, Yong Fan, Longwei Fang, Xue Feng, Enzo Ferrante, Lucas Fidon, Martin Fischer, Andrew P. French, Naomi Fridman, Huan Fu, David Fuentes, Yaozong Gao, Evan Gates, David Gering, Amir Gholami, Willi Gierke, Ben Glocker, Mingming Gong, Sandra González-Villá, T. Grosges, Yuanfang Guan, Sheng Guo, Sudeep Gupta, Woo-Sup Han, Il Song Han, Konstantin Harmuth, Huiguang He, Aura Hernández-Sabaté, Evelyn Herrmann, Naveen Himthani, Winston Hsu, Cheyu Hsu, Xiaojun Hu, Xiaobin Hu, Yan Hu, Yifan Hu, Rui Hua, Teng-Yi Huang, Weilin Huang, Sabine Van Huffel, Quan Huo, Vivek HV, Khan M. Iftekharuddin, Fabian Isensee, Mobarakol Islam, Aaron S. Jackson, Sachin R. Jambawalikar, Andrew Jesson, Weijian Jian, Peter Jin, V Jeya Maria Jose, Alain Jungo, B Kainz, Konstantinos Kamnitsas, Po-Yu Kao, Ayush Karnawat, Thomas Kellermeier, Adel Kermi, Kurt Keutzer, Mohamed Tarek Khadir, Mahendra Khened, Philipp Kickingereder, Geena Kim, Nik King, Haley Knapp, Urspeter Knecht, Lisa Kohli, Deren Kong, Xiangmao Kong, Simon Koppers, Avinash Kori, Ganapathy Krishnamurthi, Egor Krivov, Piyush Kumar, Kaisar Kushibar, Dmitrii Lachinov, Tryphon Lambrou, Joon Lee, Chengen Lee, Yuehchou Lee, M Lee, Szidonia Lefkovits, Laszlo Lefkovits, James Levitt, Tengfei Li, Hongwei Li, Hongyang Li, Xiaochuan Li, Yuexiang Li, Heng Li, Zhenye Li, Xiaoyu Li, Zeju Li, Xiaogang Li, Wenqi Li, Zheng-Shen Lin, Fengming Lin, Pietro Lio, Chang Liu, Boqiang Liu, Xiang Liu, Mingyuan Liu, Ju Liu, Luyan Liu, Xavier Llado, Marc Moreno Lopez, Pablo Ribalta Lorenzo, Zhentai Lu, Lin Luo, Zhigang Luo, Jun Ma, Kai Ma, Thomas Mackie, Anant Madabushi, Issam Mahmoudi, Klaus H. Maier-Hein, Pradipta Maji, CP Mammen, Andreas Mang, B. S. Manjunath, Michal Marcinkiewicz, S McDonagh, Stephen McKenna, Richard McKinley, Miriam Mehl, Sachin Mehta, Raghav Mehta, Raphael Meier, Christoph Meinel, Dorit Merhof, Craig Meyer, Robert Miller, Sushmita Mitra, Aliasgar Moiyadi, David Molina-Garcia, Miguel A. B. Monteiro, Grzegorz Mrukwa, Andriy Myronenko, Jakub Nalepa, Thuyen Ngo, Dong Nie, Holly Ning, Chen Niu, Nicholas K Nuechterlein, Eric Oermann, Arlindo Oliveira, Diego D. C. Oliveira, Arnau Oliver, Alexander F. I. Osman, Yu-Nian Ou, Sebastien Ourselin, Nikos Paragios, Moo Sung Park, Brad Paschke, J. Gregory Pauloski, Kamlesh Pawar, Nick Pawlowski, Linmin Pei, Suting Peng, Silvio M. Pereira, Julian Perez-Beteta, Victor M. Perez-Garcia, Simon Pezold, Bao Pham, Ashish Phophalia, Gemma Piella, G. N. Pillai, Marie Piraud, Maxim Pisov, Anmol Popli, Michael P. Pound, Reza Pourreza, Prateek Prasanna, Vesna Prkovska, Tony P. Pridmore, Santi Puch, Élodie Puybareau, Buyue Qian, Xu Qiao, Martin Rajchl, Swapnil Rane, Michael Rebsamen, Hongliang Ren, Xuhua Ren, Karthik Revanuru, Mina Rezaei, Oliver Rippel, Luis Carlos Rivera, Charlotte Robert, Bruce Rosen, Daniel Rueckert, Mohammed Safwan, Mostafa Salem, Joaquim Salvi, Irina Sanchez, Irina Sánchez, Heitor M. Santos, Emmett Sartor, Dawid Schellingerhout, Klaudius Scheufele, Matthew R. Scott, Artur A. Scussel, Sara Sedlar, Juan Pablo Serrano-Rubio, N. Jon Shah, Nameetha Shah, Mazhar Shaikh, B. Uma Shankar, Zeina Shboul, Haipeng Shen, Dinggang Shen, Linlin Shen, Haocheng Shen, Varun Shenoy, Feng Shi, Hyung Eun Shin, Hai Shu, Diana Sima, M Sinclair, Orjan Smedby, James M. Snyder, Mohammadreza Soltaninejad, Guidong Song, Mehul Soni, Jean Stawiaski, Shashank Subramanian, Li Sun, Roger Sun, Jiawei Sun, Kay Sun, Yu Sun, Guoxia Sun, Shuang Sun, Yannick R Suter, Laszlo Szilagyi, Sanjay Talbar, DaCheng Tao, Zhongzhao Teng, Siddhesh Thakur, Meenakshi H Thakur, Sameer Tharakan, Pallavi Tiwari, Guillaume Tochon, Tuan Tran, Yuhsiang M. Tsai, Kuan-Lun Tseng, Tran Anh Tuan, Vadim Turlapov, Nicholas Tustison, Maria Vakalopoulou, Sergi Valverde, Rami Vanguri, Evgeny Vasiliev, Jonathan Ventura, Luis Vera, Tom Vercauteren, C. A. Verrastro, Lasitha Vidyaratne, Veronica Vilaplana, Ajeet Vivekanandan, Qian Wang, Chiatse J. Wang, Wei-Chung Wang, Duo Wang, Ruixuan Wang, Yuanyuan Wang, Chunliang Wang, Guotai Wang, Ning Wen, Xin Wen, Leon Weninger, Wolfgang Wick, Shaocheng Wu, Qiang Wu, Yihong Wu, Yong Xia, Yanwu Xu, Xiaowen Xu, Peiyuan Xu, Tsai-Ling Yang, Xiaoping Yang, Hao-Yu Yang, Junlin Yang, Haojin Yang, Guang Yang, Hongdou Yao, Xujiong Ye, Changchang Yin, Brett Young-Moxon, Jinhua Yu, Xiangyu Yue, Songtao Zhang, Angela Zhang, Kun Zhang, Xue-jie Zhang, Lichi Zhang, Xiaoyue Zhang, Yazhuo Zhang, Lei Zhang, Jian-Guo Zhang, Xiang Zhang, Tianhao Zhang, Sicheng Zhao, Yu Zhao, Xiaomei Zhao, Liang Zhao, Yefeng Zheng, Liming Zhong, Chenhong Zhou, Xiaobing Zhou, Fan Zhou, Hongtu Zhu, Jin Zhu, Ying Zhuge, Weiwei Zong, Jayashree Kalpathy-Cramer, Keyvan Farahani, Christos Davatzikos, Koen van Leemput, Bjoern Menze

This study assesses the state-of-the-art machine learning (ML) methods used for brain tumor image analysis in mpMRI scans, during the last seven instances of the International Brain Tumor Segmentation (BraTS) challenge, i. e., 2012-2018.

Brain Tumor Segmentation Survival Prediction +1

Heteroskedastic PCA: Algorithm, Optimality, and Applications

no code implementations19 Oct 2018 Anru R. Zhang, T. Tony Cai, Yihong Wu

A general framework for principal component analysis (PCA) in the presence of heteroskedastic noise is introduced.


Hidden Hamiltonian Cycle Recovery via Linear Programming

no code implementations15 Apr 2018 Vivek Bagaria, Jian Ding, David Tse, Yihong Wu, Jiaming Xu

Represented as bicolored multi-graphs, these extreme points are further decomposed into simpler "blossom-type" structures for the large deviation analysis and counting arguments.

Traveling Salesman Problem

Entropy Rate Estimation for Markov Chains with Large State Space

no code implementations NeurIPS 2018 Yanjun Han, Jiantao Jiao, Chuan-Zheng Lee, Tsachy Weissman, Yihong Wu, Tiancheng Yu

For estimating the Shannon entropy of a distribution on $S$ elements with independent samples, [Paninski2004] showed that the sample complexity is sublinear in $S$, and [Valiant--Valiant2011] showed that consistent estimation of Shannon entropy is possible if and only if the sample size $n$ far exceeds $\frac{S}{\log S}$.

Language Modelling

Counting Motifs with Graph Sampling

no code implementations21 Feb 2018 Jason M. Klusowski, Yihong Wu

Applied researchers often construct a network from a random sample of nodes in order to infer properties of the parent network.

Graph Sampling

Estimating the Number of Connected Components in a Graph via Subgraph Sampling

no code implementations12 Jan 2018 Jason M. Klusowski, Yihong Wu

Learning properties of large graphs from samples has been an important problem in statistical network analysis since the early work of Goodman \cite{Goodman1949} and Frank \cite{Frank1978}.

Sample complexity of population recovery

no code implementations18 Feb 2017 Yury Polyanskiy, Ananda Theertha Suresh, Yihong Wu

For noisy population recovery, the sharp sample complexity turns out to be more sensitive to dimension and scales as $\exp(\Theta(d^{1/3} \log^{2/3}(1/\delta)))$ except for the trivial cases of $\epsilon=0, 1/2$ or $1$.

A deep learning model integrating FCNNs and CRFs for brain tumor segmentation

no code implementations15 Feb 2017 Xiaomei Zhao, Yihong Wu, Guidong Song, Zhenye Li, Yazhuo Zhang, Yong Fan

We train a deep learning based segmentation model using 2D image patches and image slices in following steps: 1) training FCNNs using image patches; 2) training CRFs as Recurrent Neural Networks (CRF-RNN) using image slices with parameters of FCNNs fixed; and 3) fine-tuning the FCNNs and the CRF-RNN using image slices.

Brain Tumor Segmentation Image Segmentation +2

Image Based Camera Localization: an Overview

1 code implementation12 Oct 2016 Yihong Wu, Fulin Tang, Heping Li

In this paper, an overview of image based camera localization is presented.

Autonomous Driving Camera Localization

Semidefinite Programs for Exact Recovery of a Hidden Community

no code implementations20 Feb 2016 Bruce Hajek, Yihong Wu, Jiaming Xu

We study a semidefinite programming (SDP) relaxation of the maximum likelihood estimation for exactly recovering a hidden community of cardinality $K$ from an $n \times n$ symmetric data matrix $A$, where for distinct indices $i, j$, $A_{ij} \sim P$ if $i, j$ are both in the community and $A_{ij} \sim Q$ otherwise, for two known probability distributions $P$ and $Q$.

Stochastic Block Model

Estimating the number of unseen species: A bird in the hand is worth $\log n $ in the bush

no code implementations23 Nov 2015 Alon Orlitsky, Ananda Theertha Suresh, Yihong Wu

We derive a class of estimators that $\textit{provably}$ predict $U$ not just for constant $t>1$, but all the way up to $t$ proportional to $\log n$.

Submatrix localization via message passing

no code implementations30 Oct 2015 Bruce Hajek, Yihong Wu, Jiaming Xu

The principal submatrix localization problem deals with recovering a $K\times K$ principal submatrix of elevated mean $\mu$ in a large $n\times n$ symmetric matrix subject to additive standard Gaussian noise.

Community Detection

Recovering a Hidden Community Beyond the Kesten-Stigum Threshold in $O(|E| \log^*|V|)$ Time

no code implementations9 Oct 2015 Bruce Hajek, Yihong Wu, Jiaming Xu

We show that a belief propagation algorithm achieves weak recovery if $\lambda>1/e$, beyond the Kesten-Stigum threshold by a factor of $1/e.$ The belief propagation algorithm only needs to run for $\log^\ast n+O(1) $ iterations, with the total time complexity $O(|E| \log^*n)$, where $\log^*n$ is the iterated logarithm of $n.$ Conversely, if $\lambda \leq 1/e$, no local algorithm can asymptotically outperform trivial random guessing.

Community Detection Stochastic Block Model

Information Limits for Recovering a Hidden Community

no code implementations25 Sep 2015 Bruce Hajek, Yihong Wu, Jiaming Xu

We study the problem of recovering a hidden community of cardinality $K$ from an $n \times n$ symmetric data matrix $A$, where for distinct indices $i, j$, $A_{ij} \sim P$ if $i, j$ both belong to the community and $A_{ij} \sim Q$ otherwise, for two known probability distributions $P$ and $Q$ depending on $n$.

Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions

no code implementations26 Feb 2015 Bruce Hajek, Yihong Wu, Jiaming Xu

Extending the proof techniques, in this paper it is shown that SDP relaxations also achieve the sharp recovery threshold in the following cases: (1) Binary stochastic block model with two clusters of sizes proportional to network size but not necessarily equal; (2) Stochastic block model with a fixed number of equal-sized clusters; (3) Binary censored block model with the background graph being Erd\H{o}s-R\'enyi.

Community Detection Stochastic Block Model

Achieving Exact Cluster Recovery Threshold via Semidefinite Programming

no code implementations24 Nov 2014 Bruce Hajek, Yihong Wu, Jiaming Xu

The binary symmetric stochastic block model deals with a random graph of $n$ vertices partitioned into two equal-sized clusters, such that each pair of vertices is connected independently with probability $p$ within clusters and $q$ across clusters.

Stochastic Block Model

Computational Lower Bounds for Community Detection on Random Graphs

no code implementations25 Jun 2014 Bruce Hajek, Yihong Wu, Jiaming Xu

This paper studies the problem of detecting the presence of a small dense community planted in a large Erd\H{o}s-R\'enyi random graph $\mathcal{G}(N, q)$, where the edge probability within the community exceeds $q$ by a constant factor.

Community Detection

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