The rapid growth of online short texts has made specialized analysis essential, as these texts are sparse and information-limited. Short text clustering (STC) is critical for automatically grouping unlabeled texts into meaningful clusters, supporting applications such as sentiment analysis, spam filtering, and social media personalization. In the context of massive online content, deep clustering seeks to uncover semantic categories by measuring distances in the representation space. Consequently, aligning clustering pseudo-labels with the true category distribution is crucial for effective self-supervised training, particularly under class imbalance and distribution skew commonly observed in web data. To address this challenge, we propose the Cluster Identification-Guided Dual Correction (CIDC) framework, which generates reliable pseudo-labels to guide deep clustering. Specifically, given cluster partitions and model-estimated class distributions, we perform Cluster Category Identification (CCI) at each training epoch to determine the most probable category for each cluster. This identification provides the foundation for the Pseudo-Label Correction (PLC) and Prototype-Based Correction (PBC) modules, which jointly enhance pseudo-label reliability and representation learning. In the PLC module, samples whose model-estimated class distributions conflict with the assigned cluster category are corrected, thereby improving semantic alignment within clusters. In the PBC module, representative and reliable prototypes are selected according to cluster categories and model predictions to guide training, further strengthening representation discriminability. Extensive experiments demonstrate that CIDC consistently outperforms existing methods in terms of clustering accuracy and mutual information, particularly in unsupervised settings characterized by class imbalance and noisy data.

To enable differentiation with respect to object geometries, boundary path integrals—central to physics-based differentiable rendering—must be estimated numerically. Although their mathematical formulation is well established, designing efficient and robust numerical estimators remains challenging. Most state-of-the-art boundary sampling methods rely on primary-sample-space guiding, which tends to break down on finely tessellated geometries; reparameterization-based alternatives, meanwhile, often incur high variance and/or significant computational overhead. In this paper, we introduce a simple, robust, and consistent solution to this problem. At the core of our approach is a novel formulation of the boundary integral based on kernel-density estimation. Much like photon mapping, we slightly expand the measure-zero domain of integration with a kernel, sidestepping the need to sample directly on a delta-function region in path space. To our knowledge, this is the first such application of kernel-density methods for boundary integral evaluation. We validate our method by comparing its derivative estimates against finite differences (FD), and further demonstrate its practical utility by benchmarking against several state-of-the-art baselines in synthetic inverse-rendering scenarios.

SA Conference Papers ’24, December 03–06, 2024, Tokyo, Japan

Physics-based differentiable rendering is becoming increasingly crucial for tasks in inverse rendering and machine learning pipelines. To address discontinuities caused by geometric boundaries and occlusion, two classes of methods have been proposed: 1) the edge-sampling methods that directly sample light paths at the scene discontinuity boundaries, which require nontrivial data structures and precomputation to select the edges, and 2) the reparameterization methods that avoid discontinuity sampling but are currently limited to hemispherical integrals and unidirectional path tracing. We introduce a new mathematical formulation that enjoys the benefits of both classes of methods. Unlike previous reparameterization work that focused on hemispherical integral, we derive the reparameterization in the path space. As a result, to estimate derivatives using our formulation, we can apply advanced Monte Carlo rendering methods, such as bidirectional path tracing, while avoiding explicit sampling of discontinuity boundaries. We show differentiable rendering and inverse rendering results to demonstrate the effectiveness of our method.

SUMMARY: Emerging evidences have suggested that liquid-liquid phase separation (LLPS) of proteins plays a vital role both in a wide range of biological processes and in related diseases. Whether a protein undergoes phase separation not only is determined by the chemical and physical properties of biomolecule themselves, but also is regulated by environmental conditions such as temperature, ionic strength, pH, as well as volume excluded by other macromolecules. A web accessible database LLPSDB was developed recently by our group, in which all the proteins involved in LLPS in vitro as well as corresponding experimental conditions were curated comprehensively from published literatures. With the rapid increase of investigations in biomolecular LLPS and growing popularity of LLPSDB, we updated the database, and developed a new version LLPSDB v2.0. In comparison of the previously released version, more than double contents of data are curated, and a new class 'Ambiguous system' is added. In addition, the web interface is improved, such as that users can search the database by selecting option 'phase separation status' alone or combined with other options. We anticipate that this updated database will serve as a more comprehensive and helpful resource for users. AVAILABILITY AND IMPLEMENTATION: LLPSDB v2.0 is freely available at: http://bio-comp.org.cn/llpsdbv2. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.