Related papers: Two Determinant Distinguishable Cluster

Cold-start active learning (CSAL) selects valuable instances from an unlabeled dataset for manual annotation. It provides high-quality data at a low annotation cost for label-scarce text classification. However, existing CSAL methods…

Deep subspace clustering based on auto-encoder has received wide attention. However, most subspace clustering based on auto-encoder does not utilize the structural information in the self-expressive coefficient matrix, which limits the…

We report a complete implementation of the coupled-cluster method with single, double, and triple excitations (CCSDT) where tensor decompositions are used to reduce its scaling and overall computational costs. For the decomposition of the…

We present DMCD (DataMap Causal Discovery), a two-phase causal discovery framework that integrates LLM-based semantic drafting from variable metadata with statistical validation on observational data. In Phase I, a large language model…

The multi-reference Coupled Cluster method first proposed by Meller et al (J. Chem. Phys. 1996) has been implemented and tested. Guess values of the amplitudes of the single and double excitations (the ${\hat T}$ operator) on the top of the…

In this work, we combine the many-body formulation of the internally contracted multireference coupled cluster (ic-MRCC) method with Evangelista's multireference formulation of the driven similarity renormalization group (DSRG). The DSRG…

Efficient exact algorithms for Discrete Optimization (DO) rely heavily on strong primal and dual bounds. Relaxed Decision Diagrams (DDs) provide a versatile mechanism for deriving such dual bounds by compactly over-approximating the…

We propose the DPSM method, a density-based node clustering approach that automatically determines the number of clusters and can be applied in both data space and graph space. Unlike traditional density-based clustering methods, which…

This paper proposes to perform online clustering by conducting twin contrastive learning (TCL) at the instance and cluster level. Specifically, we find that when the data is projected into a feature space with a dimensionality of the target…

The (T) and [T] perturbative corrections are derived for multicomponent coupled-cluster theory with single and double excitations (CCSD). Benchmarking shows that multicomponent CCSD methods that include the perturbative corrections are more…

The paper studies the problem of robust classification of digitally modulated signals using capsule networks and cyclic cumulant (CC) features extracted by cyclostationary signal processing (CSP). Two distinct datasets that contain similar…

As an effective tool for two-dimensional data analysis, two-dimensional canonical correlation analysis (2DCCA) is not only capable of preserving the intrinsic structural information of original two-dimensional (2D) data, but also reduces…

In this short note, we address the identifiability issues inherent in the Degree-Corrected Stochastic Block Model (DCSBM). We provide a rigorous proof demonstrating that the parameters of the DCSBM are identifiable up to a scaling factor…

We propose two novel schemes to generate the two-dimensional 2xN and 3xN cluster states by using a chain of (two-level) Rydberg atoms in the framework of cavity QED. These schemes work in a completely deterministic way and are based on the…

Many real world networks consist of multiple types of nodes with edges that are heterogeneous in nature. However, most of the existing work for community detection only focused on homogeneous network consisting of a single layer. In this…

Constrained clustering has gained significant attention in the field of machine learning as it can leverage prior information on a growing amount of only partially labeled data. Following recent advances in deep generative models, we…

Recent advances in depthwise-separable convolutional neural networks (DS-CNNs) have led to novel architectures, that surpass the performance of classical CNNs, by a considerable scalability and accuracy margin. This paper reveals another…

We study the problem of clustering with relative constraints, where each constraint specifies relative similarities among instances. In particular, each constraint $(x_i, x_j, x_k)$ is acquired by posing a query: is instance $x_i$ more…

We present a near-linear scaling formulation of the explicitly-correlated coupled-cluster singles and doubles with perturbative triples method (CCSD(T)$_{\overline{\text{F12}}}$) for high-spin states of open-shell species. The approach is…

Dictionary learning methods can be split into: i) class specific dictionary learning ii) class shared dictionary learning. The difference between the two categories is how to use discriminative information. With the first category, samples…