Regularized Multi-Task Learning for Multi-Dimensional Log-Density Gradient Estimation
Log-density gradient estimation is a fundamental statistical problem and possesses various practical applications such as clustering and measuring non-Gaussianity. A naive two-step approach of first estimating the density and then taking its log-gradient is unreliable because an accurate density estimate does not necessarily lead to an accurate log-density gradient estimate. To cope with this problem, a method to directly estimate the log-density gradient without density estimation has been explored, and demonstrated to work much better than the two-step method. The objective of this paper is to further improve the performance of this direct method in multi-dimensional cases. Our idea is to regard the problem of log-density gradient estimation in each dimension as a task, and apply regularized multi-task learning to the direct log-density gradient estimator. We experimentally demonstrate the usefulness of the proposed multi-task method in log-density gradient estimation and mode-seeking clustering.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDensity EstimationMulti-Task LearningSimilar Papers 제목 키워드 기반
Large Spectral Density Matrix Estimation by Thresholding
Spectral density matrix estimation of multivariate time series is a classical problem in time series and signal processing. In modern neuroscience, spectral density based metrics are commonly used for analyzing functiona…
Functional ConnectivityTime SeriesTime Series AnalysisAccelerated Regularized Wasserstein Proximal Sampling Algorithms
We consider sampling from a Gibbs distribution by evolving a finite number of particles using a particular score estimator rather than Brownian motion. To accelerate the particles, we consider a second-order score-based …
Learning Deep Network Representations with Adversarially Regularized Autoencoders
The problem of network representation learning, also known as network embedding, arises in many machine learning tasks assuming that there exist a small number of variabilities in the vertex representations which can cap…
Link PredictionMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATIONNetwork Embedding+1Spectral-Spatial Diffusion Geometry for Hyperspectral Image Clustering
An unsupervised learning algorithm to cluster hyperspectral image (HSI) data is proposed that exploits spatially-regularized random walks. Markov diffusions are defined on the space of HSI spectra with transitions constr…
ClusteringDensity Estimationhyperspectral image clusteringImage ClusteringEnd-to-End Multi-Object Detection with a Regularized Mixture Model
Recent end-to-end multi-object detectors simplify the inference pipeline by removing hand-crafted processes such as non-maximum suppression (NMS). However, during training, they still heavily rely on heuristics and hand-…
Density EstimationObjectobject-detectionObject Detection