Search arXiv⌕ Search

arXiv subjects

Hao Qi

Publications and source records attributed to Hao Qi.

13 recordsLinked to original sources

Beyond Homoscedasticity: Decoupled Uncertainty Optimization for Deep Imbalanced Regression

Deep Imbalanced Regression (DIR) is pervasive in continuous prediction tasks across diverse modalities, such as age estimation, depth prediction, and protein mutation activity prediction, where label-scarce tail samples often carry higher practical value. However, most existing methods still learn deterministic point mappings under mean squared error or its simple variants, implicitly assuming a uniform uncertainty level across all samples and thereby overlooking the instance-wise heteroscedasticity that is widespread in long-tailed data. We further point out that even heteroscedastic negative log-likelihood suffers from a gradient coupling issue, which, under DIR scenarios, weakens the learning signal of hard tail samples and leads to optimization inertia as well as tail underfitting. To address this, we propose DUO, an uncertainty-aware long-tailed regression framework. Specifically, the proposed method models the regression target as a conditional Gaussian distribution to explicitly characterize instance-level predictive uncertainty, and transforms uncertainty into a dynamic enhancement signal for tail samples through decoupled mean-variance optimization. Furthermore, we design a distribution-guided contrastive learning mechanism that adaptively constructs positive and negative pairs based on the overlap between sample distributions, thereby alleviating feature looseness and cross-label semantic entanglement. Across visual and biological DIR benchmarks, DUO achieves the best few-shot bMAE and GM on IMDB-WIKI-DIR, AgeDB-DIR, and AAV2-DIR while remaining competitive on few-shot MAE.

cs.LG↗

A Semi-supervised Physics-Aware Triple-Stream Underwater Image Enhancement Network

Underwater images normally suffer from degradation due to the transmission medium of water bodies. Both traditional prior-based approaches and deep learning-based methods have been used to address this problem. However, the inflexible assumption of the former often impairs their effectiveness in handling diverse underwater scenes, while the generalization of the latter to unseen images is usually weakened by insufficient data. In this study, we leverage both the physics-based Image Formation Model (IFM) and deep learning techniques for Underwater Image Enhancement (UIE). To this end, we propose a novel Physics-Aware Triple-Stream Underwater Image Enhancement Network, i.e., PATS-UIENet, which comprises a Direct Signal Transmission Estimation Stream (D-Stream), a Backscatter Signal Transmission Estimation Stream (B-Stream) and an Ambient Light Estimation Stream (A-Stream). This network fulfills the UIE task by explicitly estimating the degradation parameters of a revised IFM. We also adopt an IFM-inspired semi-supervised learning framework, which exploits both the labeled and unlabeled images, to address the issue of insufficient data. To our knowledge, such a physics-aware deep network and the IFM-inspired semi-supervised learning framework have not been used for the UIE task before. Our method performs better than, or at least comparably to, sixteen baselines across four testing sets in the degradation estimation and UIE tasks. These promising results should be due to the fact that the proposed method can not only model the degradation but also learn the characteristics of diverse underwater scenes.

cs.CV↗

Self-identifying codes in direct products of complete graphs with paths and cycles

Identifying codes were introduced by Karpovsky et al. as dominating sets $S\subseteq V(G)$ satisfying $N[u]\cap S \neq N[v]\cap S$ for any distinct vertices $u,v$. Later, Junnila et al. introduced the concept of \emph{self-identifying codes} (previously called $(1,\leq1)^+$-identifying codes in earlier work), a dominating set $S\subseteq V(G)$ such that $\bigcap_{c\in N[u]\cap S} N[c] = \{u\}$ for every vertex $u$. In this paper, we obtain bounds on the minimum size of a self-identifying code in the direct products $K_m\times P_n$ and $K_m\times C_n$ that are linear in $n$ with coefficients depending on $m$, and these bounds are asymptotically tight. In particular, for $K_m\times P_n$ with $m,n\ge3$, our bounds closely approaches the size of an identifying code in the same graph, as determined by Shinde and Waphare.

math.CO↗

Large Language Models for Mathematical Analysis

Mathematical problem-solving is a key field in artificial intelligence (AI) and a critical benchmark for evaluating the capabilities of large language models (LLMs). While extensive research has focused on mathematical problem-solving, most existing work and datasets concentrate on computational tasks, leaving gaps in areas like mathematical analysis, which demands rigorous proofs and formal reasoning. We developed the DEMI-MathAnalysis dataset, comprising proof-based problems from mathematical analysis topics such as Sequences and Limits, Infinite Series, and Convex Functions. We also designed a guiding framework to rigorously enhance LLMs' ability to solve these problems. Through fine-tuning LLMs on this dataset and employing our framework, we observed significant improvements in their capability to generate logical, complete, and elegant proofs. This work addresses critical gaps in mathematical reasoning and contributes to advancing trustworthy AI capable of handling formalized mathematical language. The code is publicly accessible at LLMs for Mathematical Analysis.

cs.CL↗

Stirling permutation codes. II

In the context of Stirling polynomials, Gessel and Stanley introduced the definition of Stirling permutation, which has attracted extensive attention over the past decades. Recently, we introduced Stirling permutation code and provided numerous equidistribution results as applications. The purpose of the present work is to further analyse Stirling permutation code. First, we derive an expansion formula expressing the joint distribution of the types $A$ and $B$ descent statistics over the hyperoctahedral group, and we also find an interlacing property involving the zeros of its coefficient polynomials. Next, we prove a strong connection between signed permutations in the hyperoctahedral group and Stirling permutations. Furthermore, we investigate unified generalizations of the trivariate second-order Eulerian polynomials and ascent-plateau polynomials. Using Stirling permutation codes, we provide expansion formulas for eight-variable and seventeen-variable polynomials, which imply several $e$-positive expansions and clarify the connections among several statistics. Our results generalize the results of Bóna, Chen-Fu, Dumont, Janson, Haglund-Visontai and Petersen.

math.CO↗

IA-GCN: Interactive Graph Convolutional Network for Recommendation

Recently, Graph Convolutional Network (GCN) has become a novel state-of-art for Collaborative Filtering (CF) based Recommender Systems (RS). It is a common practice to learn informative user and item representations by performing embedding propagation on a user-item bipartite graph, and then provide the users with personalized item suggestions based on the representations. Despite effectiveness, existing algorithms neglect precious interactive features between user-item pairs in the embedding process. When predicting a user's preference for different items, they still aggregate the user tree in the same way, without emphasizing target-related information in the user neighborhood. Such a uniform aggregation scheme easily leads to suboptimal user and item representations, limiting the model expressiveness to some extent. In this work, we address this problem by building bilateral interactive guidance between each user-item pair and proposing a new model named IA-GCN (short for InterActive GCN). Specifically, when learning the user representation from its neighborhood, we assign higher attention weights to those neighbors similar to the target item. Correspondingly, when learning the item representation, we pay more attention to those neighbors resembling the target user. This leads to interactive and interpretable features, effectively distilling target-specific information through each graph convolutional operation. Our model is built on top of LightGCN, a state-of-the-art GCN model for CF, and can be combined with various GCN-based CF architectures in an end-to-end fashion. Extensive experiments on three benchmark datasets demonstrate the effectiveness and robustness of IA-GCN.

cs.IR↗

On the joint distributions of succession and Eulerian statistics

The motivation of this paper is to investigate the joint distribution of succession and Eulerian statistics. We first investigate the enumerators for the joint distribution of descents, big ascents and successions over all permutations in the symmetric group. As an generalization a result of Diaconis-Evans-Graham (Adv. in Appl. Math., 61 (2014), 102-124), we show that two triple set-valued statistics of permutations are equidistributed on symmetric groups. We then introduce the definition of proper left-to-right minimum, and discover that the joint distribution of the succession and proper left-to-right minimum statistics over permutations is a symmetric distribution. In the final part, we discuss the relationship between the fix and cyc (p,q)-Eulerian polynomials and the joint distribution of succession and Eulerian-type statistics. In particular, we give a concise derivation of the generating function for a six-variable Eulerian polynomials.

math.CO↗

PCDF: A Parallel-Computing Distributed Framework for Sponsored Search Advertising Serving

Traditional online advertising systems for sponsored search follow a cascade paradigm with retrieval, pre-ranking,ranking, respectively. Constrained by strict requirements on online inference efficiency, it tend to be difficult to deploy useful but computationally intensive modules in the ranking stage. Moreover, ranking models currently used in the industry assume the user click only relies on the advertisements itself, which results in the ranking stage overlooking the impact of organic search results on the predicted advertisements (ads). In this work, we propose a novel framework PCDF(Parallel-Computing Distributed Framework), allowing to split the computation cost into three parts and to deploy them in the pre-module in parallel with the retrieval stage, the middle-module for ranking ads, and the post-module for re-ranking ads with external items. Our PCDF effectively reduces the overall inference latency compared with the classic framework. The whole module is end-to-end offline training and adapt for the online learning paradigm. To our knowledge, we are the first to propose an end-to-end solution for online training and deployment on complex CTR models from the system framework side.

cs.IR↗

Commuting Eulerian operators

Motivated by the work of Visontai and Dey-Sivasubramanian on the gamma-positivity of some polynomials, we find the commutative property of a pair of Eulerian operators. As an application, we show the bi-gamma-positivity of the descent polynomials on permutations of the multiset $\{1^{a_1},2^{a_2},\ldots,n^{a_n}\}$, where $0\leqslant a_i\leqslant 2$. Therefore, these descent polynomials are all alternatingly increasing, and so they are unimodal with modes in the middle.

math.CO↗

Stirling permutation codes

The development of the theories of the second-order Eulerian polynomials began with the works of Buckholtz and Carlitz in their studies of an asymptotic expansion. Gessel-Stanley introduced Stirling permutations and presented combinatorial interpretations of the second-order Eulerian polynomials. Recently, there is a growing interest in the properties of Stirling permutations. The motivation of this paper is to develop a general method for finding equidistributed statistics on Stirling permutations. Firstly, we show that the up-down-pair statistic is equidistributed with ascent-plateau statistic, and that the exterior up-down-pair statistic is equidistributed with left ascent-plateau statistic. Secondly, we introduce the Stirling permutation codes. Several equidistribution results follow from simple applications. In particular, we find that six bivariable set-valued statistics are equidistributed on the set of Stirling permutations. As an application, we extend a classical result independently established by Dumont and Bona. Thirdly, we explore bijections among Stirling permutation codes, perfect matchings and trapezoidal words. We then show the e-positivity of the enumerators of Stirling permutations by left ascent-plateaux, exterior up-down-pairs and right plateau-descents. In the final part, the e-positivity of the multivariate k-th order Eulerian polynomials is established, which improves a result of Janson-Kuba-Panholzer and generalizes a recent result of Chen-Fu.

math.CO↗

Positivity of Narayana polynomials and Eulerian polynomials

Gamma-positivity appears frequently in finite geometries, combinatorics and number theory. Motivated by the recent work of Sagan and Tirrell (Adv. Math., 374 (2020), 107387), we study the relationships between gamma-positivity and alternating gamma-positivity. As applications, we derive several alternatingly gamma-positive polynomials related to Narayana polynomials and Eulerian polynomials. In particular, we show the alternating gamma-positivity and Hurwitz stability of a combination of the modified Narayana polynomials of types A and B. By using colored $2\times n$ Young diagrams, we present a unified combinatorial interpretations of three identities involving Narayana numbers of type B. A general result of this paper is that every gamma-positive polynomial is also alternatingly semi-gamma-positive. At the end of this paper, we pose two conjectures, one concerns the Boros-Moll polynomials and the other concerns the enumerators of permutations by descents and excedances.

math.CO↗

3-degenerate induced subgraph of a planar graph

A graph $G$ is $d$-degenerate if every non-null subgraph of $G$ has a vertex of degree at most $d$. We prove that every $n$-vertex planar graph has a $3$-degenerate induced subgraph of order at least $3n/4$.

math.CO↗

Numerical study of multilayer adsorption on fractal surfaces

We report a numerical study of van der Waals adsoprtion and capillary condensation effects on self-similar fractal surfaces. An assembly of uncoupled spherical pores with a power-law distributin of radii is used to model fractal surfaces with adjustable dimensions. We find that the commonly used fractal Frankel-Halsey-Hill equation systematically fails to give the correct dimension due to crossover effects, consistent with the findings of recent experiments. The effects of pore coupling and curvature dependent surface tension were also studied.

cond-mat.soft↗