Spectral analysis of neighborhood graphs is one of the most widely used techniques for exploratory data analysis, with applications ranging from machine learning to social sciences. In such applications, it is typical to first encode relationships between the data samples using an appropriate similarity function. Popular neighborhood construction techniques such as k-nearest neighbor (k-NN) graphs are known to be very sensitive to the choice of parameters, and more importantly susceptible to noise and varying densities. In this paper, we propose the use of quantile analysis to obtain local scale estimates for neighborhood graph construction. To this end, we build an auto-encoding neural network approach for inferring conditional quantiles of a similarity function, which are subsequently used to obtain robust estimates of the local scales. In addition to being highly resilient to noise or outlying data, the proposed approach does not require extensive parameter tuning unlike several existing methods. Using applications in spectral clustering and single-example label propagation, we show that the proposed neighborhood graphs outperform existing locally scaled graph construction approaches.
Evaluating Dynamic Conditional Quantile Treatment Effects with Applications in Ridesharing
DiDi Chuxing(滴滴出行);University of North Carolina at Chapel Hill(北卡罗来纳大学教堂山分校);Shanghai University of Finance and Economics(上海财经大学);London School of Economics and Political Science(伦敦政治经济学院)
Conditional Diffusion for Nonparametric Instrumental Variable Quantile Regression
Institute of Data Science and Statistics, Shanghai University of Finance and Economics(上海财经大学数据科学与统计研究院);School of Mathematics and Statistics, Wuhan University(武汉大学数学与统计学院);School of Artificial Intelligence, Wuhan University(武汉大学人工智能学院)
Rectifying Conformity Scores for Better Conditional Coverage
Mohamed bin Zayed University of Artificial Intelligence(莫扎德·本·扎耶德人工智能大学);Skolkovo Institute of Science(斯克尔科沃科学研究所);University of Mons(蒙斯大学);Computing Research Center(计算研究中心)