Searcharxiv⌕ Search

arXiv subjects

An Zhang

Publications and source records attributed to An Zhang.

125 records · Page 7Linked to original sources

Discovering Invariant Rationales for Graph Neural Networks

Intrinsic interpretability of graph neural networks (GNNs) is to find a small subset of the input graph's features -- rationale -- which guides the model prediction. Unfortunately, the leading rationalization models often rely on data biases, especially shortcut features, to compose rationales and make predictions without probing the critical and causal patterns. Moreover, such data biases easily change outside the training distribution. As a result, these models suffer from a huge drop in interpretability and predictive performance on out-of-distribution data. In this work, we propose a new strategy of discovering invariant rationale (DIR) to construct intrinsically interpretable GNNs. It conducts interventions on the training distribution to create multiple interventional distributions. Then it approaches the causal rationales that are invariant across different distributions while filtering out the spurious patterns that are unstable. Experiments on both synthetic and real-world datasets validate the superiority of our DIR in terms of interpretability and generalization ability on graph classification over the leading baselines. Code and datasets are available at https://github.com/Wuyxin/DIR-GNN.

cs.LG↗

Approximation algorithms for the directed path partition problems

Given a directed graph $G = (V, E)$, the $k$-path partition problem is to find a minimum collection of vertex-disjoint directed paths each of order at most $k$ to cover all the vertices of $V$. The problem has various applications in facility location, network monitoring, transportation and others. Its special case on undirected graphs has received much attention recently, but the general directed version is seemingly untouched in the literature. We present the first $k/2$-approximation algorithm, for any $k \ge 3$, based on a novel concept of augmenting path to minimize the number of singletons in the partition. When $k \ge 7$, we present an improved $(k+2)/3$-approximation algorithm based on the maximum path-cycle cover followed by a careful $2$-cycle elimination process. When $k = 3$, we define the second novel kind of augmenting paths and propose an improved $13/9$-approximation algorithm.

cs.DS↗

A-FMI: Learning Attributions from Deep Networks via Feature Map Importance

Gradient-based attribution methods can aid in the understanding of convolutional neural networks (CNNs). However, the redundancy of attribution features and the gradient saturation problem, which weaken the ability to identify significant features and cause an explanation focus shift, are challenges that attribution methods still face. In this work, we propose: 1) an essential characteristic, Strong Relevance, when selecting attribution features; 2) a new concept, feature map importance (FMI), to refine the contribution of each feature map, which is faithful to the CNN model; and 3) a novel attribution method via FMI, termed A-FMI, to address the gradient saturation problem, which couples the target image with a reference image, and assigns the FMI to the difference-from-reference at the granularity of feature map. Through visual inspections and qualitative evaluations on the ImageNet dataset, we show the compelling advantages of A-FMI on its faithfulness, insensitivity to the choice of reference, class discriminability, and superior explanation performance compared with popular attribution methods across varying CNN architectures.

cs.CV↗

Disentangled Graph Collaborative Filtering

Learning informative representations of users and items from the interaction data is of crucial importance to collaborative filtering (CF). Present embedding functions exploit user-item relationships to enrich the representations, evolving from a single user-item instance to the holistic interaction graph. Nevertheless, they largely model the relationships in a uniform manner, while neglecting the diversity of user intents on adopting the items, which could be to pass time, for interest, or shopping for others like families. Such uniform approach to model user interests easily results in suboptimal representations, failing to model diverse relationships and disentangle user intents in representations. In this work, we pay special attention to user-item relationships at the finer granularity of user intents. We hence devise a new model, Disentangled Graph Collaborative Filtering (DGCF), to disentangle these factors and yield disentangled representations. Specifically, by modeling a distribution over intents for each user-item interaction, we iteratively refine the intent-aware interaction graphs and representations. Meanwhile, we encourage independence of different intents. This leads to disentangled representations, effectively distilling information pertinent to each intent. We conduct extensive experiments on three benchmark datasets, and DGCF achieves significant improvements over several state-of-the-art models like NGCF, DisenGCN, and MacridVAE. Further analyses offer insights into the advantages of DGCF on the disentanglement of user intents and interpretability of representations. Our codes are available in https://github.com/xiangwang1223/disentangled_graph_collaborative_filtering.

cs.IR↗

Approximation algorithms for maximally balanced connected graph partition

Given a simple connected graph $G = (V, E)$, we seek to partition the vertex set $V$ into $k$ non-empty parts such that the subgraph induced by each part is connected, and the partition is maximally balanced in the way that the maximum cardinality of these $k$ parts is minimized. We refer this problem to as {\em min-max balanced connected graph partition} into $k$ parts and denote it as {\sc $k$-BGP}. The general vertex-weighted version of this problem on trees has been studied since about four decades ago, which admits a linear time exact algorithm; the vertex-weighted {\sc $2$-BGP} and {\sc $3$-BGP} admit a $5/4$-approximation and a $3/2$-approximation, respectively; but no approximability result exists for {\sc $k$-BGP} when $k \ge 4$, except a trivial $k$-approximation. In this paper, we present another $3/2$-approximation for our cardinality {\sc $3$-BGP} and then extend it to become a $k/2$-approximation for {\sc $k$-BGP}, for any constant $k \ge 3$. Furthermore, for {\sc $4$-BGP}, we propose an improved $24/13$-approximation. To these purposes, we have designed several local improvement operations, which could be useful for related graph partition problems.

cs.DS↗

A local search $4/3$-approximation algorithm for the minimum $3$-path partition problem

Given a graph $G = (V, E)$, the $3$-path partition problem is to find a minimum collection of vertex-disjoint paths each of order at most $3$ to cover all the vertices of $V$. It is different from but closely related to the well-known $3$-set cover problem. The best known approximation algorithm for the $3$-path partition problem was proposed recently and has a ratio $13/9$. Here we present a local search algorithm and show, by an amortized analysis, that it is a $4/3$-approximation. This ratio matches up to the best approximation ratio for the $3$-set cover problem.

cs.DS↗

Improved approximation algorithms for path vertex covers in regular graphs

Given a simple graph $G = (V, E)$ and a constant integer $k \ge 2$, the $k$-path vertex cover problem ({\sc P$k$VC}) asks for a minimum subset $F \subseteq V$ of vertices such that the induced subgraph $G[V - F]$ does not contain any path of order $k$. When $k = 2$, this turns out to be the classic vertex cover ({\sc VC}) problem, which admits a $\left(2 - {\rm Θ}\left(\frac 1{\log|V|}\right)\right)$-approximation. The general {\sc P$k$VC} admits a trivial $k$-approximation; when $k = 3$ and $k = 4$, the best known approximation results for {\sc P$3$VC} and {\sc P$4$VC} are a $2$-approximation and a $3$-approximation, respectively. On $d$-regular graphs, the approximation ratios can be reduced to $\min\left\{2 - \frac 5{d+3} + ε, 2 - \frac {(2 - o(1))\log\log d}{\log d}\right\}$ for {\sc VC} ({\it i.e.}, {\sc P$2$VC}), $2 - \frac 1d + \frac {4d - 2}{3d |V|}$ for {\sc P$3$VC}, $\frac {\lfloor d/2\rfloor (2d - 2)}{(\lfloor d/2\rfloor + 1) (d - 2)}$ for {\sc P$4$VC}, and $\frac {2d - k + 2}{d - k + 2}$ for {\sc P$k$VC} when $1 \le k-2 < d \le 2(k-2)$. By utilizing an existing algorithm for graph defective coloring, we first present a $\frac {\lfloor d/2\rfloor (2d - k + 2)}{(\lfloor d/2\rfloor + 1) (d - k + 2)}$-approximation for {\sc P$k$VC} on $d$-regular graphs when $1 \le k - 2 < d$. This beats all the best known approximation results for {\sc P$k$VC} on $d$-regular graphs for $k \ge 3$, except for {\sc P$4$VC} it ties with the best prior work and in particular they tie at $2$ on cubic graphs and $4$-regular graphs. We then propose a $1.875$-approximation and a $1.852$-approximation for {\sc P$4$VC} on cubic graphs and $4$-regular graphs, respectively. We also present a better approximation algorithm for {\sc P$4$VC} on $d$-regular bipartite graphs.

cs.DS↗

Approximation algorithms for the three-machine proportionate mixed shop scheduling

A mixed shop is a manufacturing infrastructure designed to process a mixture of a set of flow-shop jobs and a set of open-shop jobs. Mixed shops are in general much more complex to schedule than flow-shops and open-shops, and have been studied since the 1980's. We consider the three machine proportionate mixed shop problem denoted as $M3 \mid prpt \mid C_{\max}$, in which each job has equal processing times on all three machines. Koulamas and Kyparisis [{\it European Journal of Operational Research}, 243:70--74,2015] showed that the problem is solvable in polynomial time in some very special cases; for the non-solvable case, they proposed a $5/3$-approximation algorithm. In this paper, we present an improved $4/3$-approximation algorithm and show that this ratio of $4/3$ is asymptotically tight; when the largest job is a flow-shop job, we present a fully polynomial-time approximation scheme (FPTAS). On the negative side, while the $F3 \mid prpt \mid C_{\max}$ problem is polynomial-time solvable, we show an interesting hardness result that adding one open-shop job to the job set makes the problem NP-hard if this open-shop job is larger than any flow-shop job. We are able to design an FPTAS for this special case too.

cs.DS↗

Coherent control of superradiance from nitrogen ions pumped with femtosecond pulses

Singly ionized nitrogen molecules in ambient air pumped by near-infrared femtosecond laser give rise to superradiant emission. Here we demonstrate coherent control of this superradiance by injecting a pair of resonant seeding pulses inside the nitrogen gas plasma. Strong modulation of the 391.4 nm superradiance with a period of 1.3 fs is observed when the delay between the two seeding pulses are finely tuned, pinpointing the essential role of macroscopic coherence in this lasing process. Based on this time-resolved method, the complex temporal evolution of the macroscopic coherence between two involved energy levels has been experimentally revealed, which is found to last for around 10 picoseconds in the low gas pressure range. These observations provide a new level of control on the "air lasing" based on nitrogen ions, which can find potential applications in optical remote sensing.

physics.optics↗

Approximation algorithms for two-machine flow-shop scheduling with a conflict graph

Path cover is a well-known intractable problem that finds a minimum number of vertex disjoint paths in a given graph to cover all the vertices. We show that a variant, where the objective function is not the number of paths but the number of length-$0$ paths (that is, isolated vertices), turns out to be polynomial-time solvable. We further show that another variant, where the objective function is the total number of length-$0$ and length-$1$ paths, is also polynomial-time solvable. Both variants find applications in approximating the two-machine flow-shop scheduling problem in which job processing has constraints that are formulated as a conflict graph. For the unit jobs, we present a $4/3$-approximation algorithm for the scheduling problem with an arbitrary conflict graph, based on the exact algorithm for the variants of the path cover problem. For the arbitrary jobs while the conflict graph is the union of two disjoint cliques, that is, all the jobs can be partitioned into two groups such that the jobs in a group are pairwise conflicting, we present a simple $3/2$-approximation algorithm.

cs.DS↗

On the NP-hardness of scheduling with time restrictions

In a recent paper, Braun, Chung and Graham [1] have addressed a single-processor scheduling problem with time restrictions. Given a fixed integer $B \geq 2$, there is a set of jobs to be processed by a single processor subject to the following B-constraint. For any real $x$, no unit time interval $[x, x+1)$ is allowed to intersect more than $B$ jobs. The problem has been shown to be NP-hard when $B$ is part of the input and left as an open question whether it remains NP-hard or not if $B$ is fixed [1, 5, 7]. This paper contributes to answering this question that we prove the problem is NP-hard even when $B=2$. A PTAS is also presented for any constant $B \geq 2$.

cs.DS↗

Flows and functional inequalities for fractional operators

This paper collects results concerning global rates and large time asymptotics of a fractional fast diffusion on the Euclidean space, which is deeply related with a family of fractional Gagliardo-Nirenberg-Sobolev inequalities. Generically, self-similar solutions are not optimal for the Gagliardo-Nirenberg-Sobolev inequalities, in strong contrast with usual standard fast diffusion equations based on non-fractional operators. Various aspects of the stability of the self-similar solutions and of the entropy methods like carr{é} du champ and R{é}nyi entropy powers methods are investigated and raise a number of open problems.

math.AP↗

Optimal functional inequalities for fractional operators on the sphere and applications

This paper is devoted to optimal functional inequalities for fractional Laplace operators on the sphere. Based on spectral properties, subcritical inequalities are established. Their consequences for fractional heat flows are considered. These subcritical inequalities interpolate between fractional Sobolev and subcritical fractional logarithmic Sobolev inequalities. Their optimal constants are determined by a spectral gap. In the subcritical range, the method also provides us with remainder terms which can be considered as an improved version of the optimal inequalities. We also consider inequalities which interpolate between fractional logarithmic Sobolev and fractional Poincar{é} inequalities. Finally, weighted inequalities involving the fractional Laplacian are obtained in the Euclidean space, using a stereographic projection and scaling properties.

math.AP↗

Restriction Theorems On Métiver Groups Associated to Joint Functional Calculus

In this article, we get the spectral solution $\mathcal{P}_μ^{m}$ of operators $m(\mathcal{L}, -Δ_\mathfrak{z})$, the joint functional calculus of the sub-Laplacian and Laplacian on the centre of Métivier group. Then, we give some group-analogues of the Thomas-Stein-type restriction theorem, asserting the mix-norm boundness of the restriction operators $\mathcal{P}_μ^{m}$ for two classes of functions $m=(a^α+b^β)^γ$ and $m=(1+a^α+b^β)^γ$ with $α, β>0, γ\neq0$.

math.FA↗

Remainder Terms for Several Inequalities on Some Groups of Heisenberg-type

We give some estimates of the remainder terms for several conformally-invariant Sobolev-type inequalities on the Heisenberg group, in analogy with the Euclidean case. By considering the variation of associated functionals, we give a stability of two dual forms: the fractional Sobolev (Folland-Stein) and Hardy-Littlewood-Sobolev inequality, in terms of distance to the submanifold of extremizers. Then we compare their remainder terms to improve the inequalities in another way. We also compare, in the limit case s = Q (or $λ$ = 0), the remainder terms of Beckner-Onofri inequality and its dual Logarithmic Hardy-Littlewood-Sobolev inequality. Besides, we also list without proof some results for the other two cases of groups of Iwasawa-type. Our results generalize earlier works on Euclidean spaces by Chen, Frank, Weth [CFW13] and Dolbeault, Jankowiakin [DJ14] onto some groups of Heisenberg-type.

math.AP↗

Sharp Hardy-Littlewood-Sobolev Inequalities on Quaternionic Heisenberg Groups

In this paper, we got several sharp Hardy-Littlewood-Sobolev-type inequalities on quaternionic Heisenberg groups (a general form due to Folland and Stein [FS74]), using the symmetrization-free method in a paper of Frank and Lieb [FL12], where they considered the analogues on classical Heisenberg group. First, we give the sharp Hardy-Littlewood-Sobolev inequalities, both on quaternionic Heisenberg group and its equivalent on quaternionic sphere for exponent bigger than 4. The extremizer, as we guess, is almost uniquely constant function on sphere. Then their dual form, sharp conformally-invariant Sobolev inequalities and the right endpoint limit case, Log-Sobolev inequality, are also obtained. For small exponent less 4, constant function is only proved to be a local extremizer. The conformal symmetry of the inequalities and zero center-mass technique play a critical role in the argument.

math.CA↗

Sharp Hardy-Littlewood-Sobolev Inequalities on Octonionic Heisenberg Group

This paper is a second one following our work [CLZ13] in series, considering sharp Hardy- Littlewood-Sobolev inequalities on groups of Heisenberg type. The first important breakthrough was made by Frank and Lieb in [FL12]. In this paper, analogous results are obtained for octonionic Heisenberg group.

math.FA↗