SearcharxivSearch

arXiv subjects

Jiajun Hu

Publications and source records attributed to Jiajun Hu.

At least 19 recordsLinked to original sources

NIFA: Nonlinear IMC enhanced FPGA for efficient ML inference

Recent FPGAs have improved deep learning (DL) inference efficiency through dedicated tensor blocks and in-BRAM computation. ReRAM-based analog in-memory computing (IMC) pushes efficiency further, offering an order-of-magnitude improvement in compute density and energy efficiency over conventional digital logic by performing vector-matrix multiplication (VMM) directly within the ReRAM crossbar; prior work has integrated such IMC blocks into FPGAs for DL inference. However, conventional IMC designs support only static-weight VMM, leaving nonlinear operations and dynamic matrix-matrix multiplication (DIMM) to the FPGA fabric. As a result, the benefits of IMC are largely confined to static-weight models, whereas Transformer-based models, which rely on frequent nonlinear and DIMM operations, gain only limited improvement. Moreover, the ADCs within each IMC block consume more than 70% of its area and power, further limiting system efficiency and scalability. To address these limitations, we propose a novel FPGA architecture that integrates an ADC-free IMC block, replacing the conventional ADC with analog content-addressable memories (ACAMs) that natively perform nonlinear operations inside the block. To fully exploit this block, we conduct an FPGA-aware design-space exploration that determines optimal crossbar dimensions while balancing FPGA area, flexibility, and DL performance, and we develop an efficient mapping that leverages ACAMs to carry out DIMM operations, extending the applicability of IMC to attention computation. On CNN and Transformer-based benchmarks, the proposed architecture achieves up to 40x and 1.9x higher energy efficiency and 4.1x and 2.5x higher area efficiency, respectively. Overall, it significantly improves FPGA DL inference efficiency and sustains robust gains on Transformer-based workloads across long input sequences, advancing domain-specialized FPGA design.

cs.AR

Boosting FPGA Performance with Direct BRAM-DSP Paths

Efficient data movement between memory and compute units is a key performance bottleneck in modern FPGA designs, particularly for deep learning (DL) workloads. In typical FPGA architectures, data transfers between block RAMs (BRAMs) and digital signal processing units (DSPs) must traverse the global routing network, leading to increased wirelength, routing congestion, and critical-path delays. Prior work has explored in- and near-BRAM compute architectures to mitigate these issues, but such solutions often require fundamental changes to FPGA architecture and CAD tools, limiting their commercial viability. This paper proposes a lightweight architectural enhancement that introduces a dedicated direct connection between BRAM and DSP blocks, enabling BRAM data to be consumed by DSPs without passing through the global interconnect. We also enhance the placement algorithm to recognize these BRAM-DSP macro blocks. The proposed architectural change incurs negligible area and delay overhead and does not affect non-DL benchmarks, while the proposed CAD remains compatible with the baseline architecture, where it yields negligible change in quality-of-results (QoR). On an Agilex-10-like FPGA, the proposed architecture and CAD updates deliver up to +25% Fmax and -49% wirelength on common DL layer designs.

cs.AR

Maximum Entropy Behavior Exploration for Sim2Real Zero-Shot Reinforcement Learning

Zero-shot reinforcement learning (RL) algorithms aim to learn a family of policies from a reward-free dataset, and recover optimal policies for any reward function directly at test time. Naturally, the quality of the pretraining dataset determines the performance of the recovered policies across tasks. However, pre-collecting a relevant, diverse dataset without prior knowledge of the downstream tasks of interest remains a challenge. In this work, we study $\textit{online}$ zero-shot RL for quadrupedal control on real robotic systems, building upon the Forward-Backward (FB) algorithm. We observe that undirected exploration yields low-diversity data, leading to poor downstream performance and rendering policies impractical for direct hardware deployment. Therefore, we introduce FB-MEBE, an online zero-shot RL algorithm that combines an unsupervised behavior exploration strategy with a regularization critic. FB-MEBE promotes exploration by maximizing the entropy of the achieved behavior distribution. Additionally, a regularization critic shapes the recovered policies toward more natural and physically plausible behaviors. We empirically demonstrate that FB-MEBE achieves and improved performance compared to other exploration strategies in a range of simulated downstream tasks, and that it renders natural policies that can be seamlessly deployed to hardware without further finetuning. Videos and code available on our website.

cs.LG

CarbonPATH: Carbon-aware pathfinding and architecture optimization for chiplet-based AI systems

The exponential growth of AI has created unprecedented demand for computational resources, pushing chip designs to the limit while simultaneously escalating the environmental footprint of computing. As the industry transitions toward heterogeneous integration (HI) to address the yield and cost challenges of monolithic scaling, minimizing the carbon cost of these complex HI systems becomes critical. To fully exploit HI, a co-design approach spanning application, architecture, chip, and packaging is essential. However, this creates a vast design space with competing objectives, specifically the trade-offs between performance, cost, and carbon footprint (CFP) for sustainability. CarbonPATH is an early-stage pathfinding framework designed to address this multi-objective challenge. It identifies optimized HI systems by co-designing workload mapping, architectural parameters, and packaging technologies, while treating sustainability as a first-class design constraint. The framework accounts for a wide range of factors, including compute and memory sizes, chiplet technology nodes, communication protocols, integration style (2D, 2.5D, 3D), operational CFP, embodied CFP, and interconnect type. Using simulated annealing, CarbonPATH explores this high-dimensional space to identify solutions that balance traditional metrics against environmental impact. By capturing interactions across applications, architectures, chiplets, and packaging, CarbonPATH uncovers system-level solutions that traditional methods often miss due to restrictive assumptions or limited scope.

cs.AR

RACAM: Enhancing DRAM with Reuse-Aware Computation and Automated Mapping for ML Inference

In-DRAM Processing-In-Memory (DRAM-PIM) has emerged as a promising approach to accelerate memory-intensive workloads by mitigating data transfer overhead between DRAM and the host processor. Bit-serial DRAM-PIM architectures, further enhance efficiency by supporting runtime variable data precision, which is critical for emerging workloads, such as large language model (LLM) inference. However, existing works still have major limitations: lack of data reuse, significant amounts of redundant data transfer, and insufficient support for workload mapping. To address these issues, we propose RACAM, the first in-DRAM bit-serial architecture which uses dedicated locality buffers, bit-serial PEs, popcount reduction units and broadcast units to enable data reuse and alleviate redundant data transfers. Furthermore, a workload mapping mechanism is proposed to fully explore the massive parallelism of DRAM architecture and identify the best mapping scheme of a given workload. We evaluate RACAM against GPUs and the state-of-the-art, in-DRAM PIM system, Proteus, across end-to-end LLM inferences. RACAM achieves 9x to 102x speedup over GPUs and 233x higher performance per mm2 compared to Proteus in case of GPT3.

cs.AR

CarbonSet: A Dataset to Analyze Trends and Benchmark the Sustainability of CPUs and GPUs

Over the years, the chip industry has consistently developed high-performance processors to address the increasing demands across diverse applications. However, the rapid expansion of chip production has significantly increased carbon emissions, raising critical concerns about environmental sustainability. While researchers have previously modeled the carbon footprint (CFP) at both system and processor levels, a holistic analysis of sustainability trends encompassing the entire chip lifecycle remains lacking. This paper presents CarbonSet, a comprehensive dataset integrating sustainability and performance metrics for CPUs and GPUs over the past decade. CarbonSet aims to benchmark and assess the design of next-generation processors. Leveraging this dataset, we conducted detailed analysis of flagship processors' sustainability trends over the last decade. This paper further highlights that modern processors are not yet sustainably designed, with total carbon emissions increasing more than 50$\times$ in the past three years due to the surging demand driven by the AI boom. Power efficiency remains a significant concern, while advanced process nodes pose new challenges requiring to effectively amortize the dramatically increased manufacturing carbon emissions.

cs.AR

Numerical characterization of the hard Lefschetz classes of dimension two, II: supercritical collections of free divisor classes

For $(n-2)$ free divisor classes on a smooth projective variety of dimension $n$, the product of these free divisor classes induces a Lefschetz type operator acting on the N\'{e}ron-Severi space or the cohomology group of $(1,1)$ classes. We give a characterization of this kernel space, when the collection of these free divisor classes is supercritical. This resolves Shenfeld-van Handel's open problem in this setting. As consequences, we provide an algebro-geometric proof of the characterization of the extremals of the Alexandrov-Fenchel inequality for a supercritical collection of rational convex polytopes; we also give a characterization of the extremals of the Khovanskii-Teissier inequality given by the intersection numbers of two arbitrary free divisor classes.

math.AG

Positivity in the shadow of Hodge index theorem

Taking a compact K\"{a}hler manifold as playground, we explore the powerfulness of Hodge index theorem. A main object is the Lorentzian classes on a compact K\"{a}hler manifold, behind which the characterization via Lorentzian polynomials over the K\"{a}hler cone and hence the validity of Hodge index theorem. Along the exploration, we discover several applications in complex geometry that may be unexpected before. (1) For a Lefschetz type operator given by the complete intersection of nef classes, we give a complete characterization of its kernel face against the pseudo-effective cone. (2) We provide a new approach to Teissier's proportionality problem from the validity of hard Lefschetz property. This perspective enables us to establish the extremals for the Brunn-Minkowski inequality on a strictly Lorentzian class, and thus also characterize the most extremal case for a log-concavity sequence given by the intersection numbers of two nef classes. These Lorentzian classes include the fundamental classes of smooth projective varieties or compact K\"{a}hler manifolds as typical examples, hence our result extends Boucksom-Favre-Jonsson's and Fu-Xiao's results in respective settings to broader contexts, e.g. certain algebraic cycle classes given by reducible subvarieties. (3) Furthermore, we also strengthen the proportionality characterization by comparing various quantitative deficits and establishing stability estimates. Two quantitative sharper stability estimates with close relation with complex Monge--Amp\`{e}re equations and Newton-Okounkov bodies are also discussed.

math.AG

Unravelling the influence of shell thickness in organic functionalized Cu2O nanoparticles on C2+ products distribution in electrocatalytic CO2 reduction

Cu-based electrocatalysts exhibits enormous potential for electrochemical CO2 conversion to added-value products. However, high selectivity, specially towards C2+ products, remains a critical challenge for its implementation in commercial applications. Herein, we report the preparation of a series of electrocatalysts based on octadecyl amine (ODA) coated Cu2O nanoparticles. HRTEM images show ODA coatings with thickness from 1.2 to 4 nm. DFT calculations predict that at low surface coverage, ODA tends to lay on the Cu2O surface, leaving hydrophilic regions. Oppositely, at high surface coverage, the ODA molecules are densely packed, being detrimental for both mass and charge transfer. These changes in ODA molecular arrangement explain differences in product selectivity. In situ Raman spectroscopy has revealed that the optimum ODA thickness contributes to the stabilization of key intermediates in the formation of C2+ products, especially ethanol. Electrochemical impedance spectroscopy and pulse voltammetry measurements confirm that the thicker ODA shells increase charge transfer resistance, while the lowest ODA content promotes faster intermediate desorption rates. At the optimum thickness, the intermediates desorption rates are the slowest, in agreement with the maximum concentration of intermediates observed by in situ Raman spectroscopy, thereby resulting in a Faradaic efficiency to ethanol and ethylene over 73 %.

cond-mat.mtrl-sci

Mixed Fe-Mo carbide prepared by a sonochemical synthesis as highly efficient nitrate reduction electrocatalyst

Ammonia, a versatile compound that can be used as a fertilizer, chemical or fuel, has since long been produced through the energy-intensive Haber-Bosch process. Recently, the electrochemical nitrate reduction reaction (NO3RR) using electricity generated from renewable sources has attracted widespread attention. However, the complex reaction pathway of NO3RR leads to the formation of many undesirable by-products. Herein we successfully prepared a mixed (FeMo)2C catalyst with good electrocatalytic NO3RR, having a NH3 yield of 14.66 mg h-1 cm-2 and an FE of 94.35 % at low potential -0.3 V vs RHE. DFT calculations show that the presence of Fe in Mo2C lattice changes the reaction mechanism, decreasing the potential barrier to be overcome from 1.36 to 0.89 eV. In addition, mixed Fe-Mo carbide facilitates the adsorption of intermediates and promotes NH3 desorption, facilitating NO3- reduction to NH3. In addition, (FeMo)2C was used as cathode for Zn-NO3 battery to generate electricity, producing ammonia at the same time, with a power density of 3.8 mWcm-2 and an NH3 FE of 88 %. This work describes a new synthesis method for mixed metal carbides and provides a promising strategy for NH3 production.

cond-mat.mtrl-sci

DiffCL: A Diffusion-Based Contrastive Learning Framework with Semantic Alignment for Multimodal Recommendations

Multimodal recommendation systems integrate diverse multimodal information into the feature representations of both items and users, thereby enabling a more comprehensive modeling of user preferences. However, existing methods are hindered by data sparsity and the inherent noise within multimodal data, which impedes the accurate capture of users' interest preferences. Additionally, discrepancies in the semantic representations of items across different modalities can adversely impact the prediction accuracy of recommendation models. To address these challenges, we introduce a novel diffusion-based contrastive learning framework (DiffCL) for multimodal recommendation. DiffCL employs a diffusion model to generate contrastive views that effectively mitigate the impact of noise during the contrastive learning phase. Furthermore, it improves semantic consistency across modalities by aligning distinct visual and textual semantic information through stable ID embeddings. Finally, the introduction of the Item-Item Graph enhances multimodal feature representations, thereby alleviating the adverse effects of data sparsity on the overall system performance. We conduct extensive experiments on three public datasets, and the results demonstrate the superiority and effectiveness of the DiffCL.

cs.MM

Learn to Preserve and Diversify: Parameter-Efficient Group with Orthogonal Regularization for Domain Generalization

Domain generalization (DG) aims to avoid the performance degradation of the model when the distribution shift between the limited training data and unseen test data occurs. Recently, foundation models with enormous parameters have been pre-trained with huge datasets, demonstrating strong generalization ability and showing promising direction for solving the DG problem. However, fully Fine-Tuning (FT) the foundation models results in unsatisfactory out-of-distribution accuracy due to the destroyed pre-trained generalized features. Recently, Parameter-Efficient Fine-Tuning (PEFT) alleviates the above problem by fine-tuning a small portion of the model parameters while keeping the rest frozen, which achieves better generalization performance compared to FT. Nevertheless, PEFT still suffers from the issue of overfitting to the training domains. To address the above issue, we propose Parameter-Efficient Group with Orthogonal regularization (PEGO) for vision transformers, which effectively preserves the generalization ability of the pre-trained network and learns more diverse knowledge compared with conventional PEFT. Specifically, we inject a group of trainable Low-Rank Adaptation (LoRA) modules into the pre-trained model and propose an orthogonal regularization loss to enhance the generalization ability of the model. Our framework achieves SOTA performance on five DG benchmarks, while only requiring training a small number of parameters without adding additional testing cost.

cs.CV

Generative prediction of flow fields around an obstacle using the diffusion model

We propose a geometry-to-flow diffusion model that utilizes obstacle shape as input to predict a flow field around an obstacle. The model is based on a learnable Markov transition kernel to recover the data distribution from the Gaussian distribution. The Markov process is conditioned on the obstacle geometry, estimating the noise to be removed at each step, implemented via a U-Net. A cross-attention mechanism incorporates the geometry as a prompt. We train the geometry-to-flow diffusion model using a dataset of flows around simple obstacles, including circles, ellipses, rectangles, and triangles. For comparison, two CNN-based models and a VAE model are trained on the same dataset. Tests are carried out on flows around obstacles with simple and complex geometries, representing interpolation and generalization on the geometry condition, respectively. To evaluate performance under demanding conditions, the test set incorporates scenarios including crosses and the characters `PKU.' Generated flow fields show that the geometry-to-flow diffusion model is superior to the CNN-based models and the VAE model in predicting instantaneous flow fields and handling complex geometries. Quantitative analysis of the accuracy and divergence demonstrates the model's robustness.

physics.flu-dyn

Successive Model-Agnostic Meta-Learning for Few-Shot Fault Time Series Prognosis

Meta learning is a promising technique for solving few-shot fault prediction problems, which have attracted the attention of many researchers in recent years. Existing meta-learning methods for time series prediction, which predominantly rely on random and similarity matching-based task partitioning, face three major limitations: (1) feature exploitation inefficiency; (2) suboptimal task data allocation; and (3) limited robustness with small samples. To overcome these limitations, we introduce a novel 'pseudo meta-task' partitioning scheme that treats a continuous time period of a time series as a meta-task, composed of multiple successive short time periods. Employing continuous time series as pseudo meta-tasks allows our method to extract more comprehensive features and relationships from the data, resulting in more accurate predictions. Moreover, we introduce a differential algorithm to enhance the robustness of our method across different datasets. Through extensive experiments on several fault and time series prediction datasets, we demonstrate that our approach substantially enhances prediction performance and generalization capability under both few-shot and general conditions.

cs.LG

Numerical characterization of the hard Lefschetz classes of dimension two, I: supercritical collections under certain rearrangement

We study the numerical characterization of two dimensional hard Lefschetz classes given by the complete intersections of nef classes. In Shenfeld and van Handel's breakthrough work on the characterization of the extremals of the Alexandrov-Fenchel inequality for convex polytopes, they proposed an open question on the algebraic analogue of the characterization. We settle the open question when the collection of nef classes is given by a rearrangement of supercriticality, which in particular includes the big nef collection as a special case. The main results enable us to refine some previous results and study the extremals of Hodge index inequality, and also provide the first series of examples of hard Lefschetz classes of dimension two both in algebraic geometry and analytic geometry, in which one can allow nontrivial augmented base locus and thus drop the semi-ampleness or semi-positivity assumption. As a key ingredient of the numerical characterization, we establish a local Hodge index inequality for Lorentzian polynomials, which is the algebraic analogue of the local Alexandrov-Fenchel inequality obtained by Shenfeld-van Handel for convex polytopes. This result holds in broad contexts, e.g., it holds on a smooth projective variety, on a compact K\"ahler manifold, and on a Lorentzian fan, which contains the Bergman fan of a matroid or a polymatroid as a typical example.

math.AG

$\omega$Test: WebView-Oriented Testing for Android Applications

WebView is a UI widget that helps integrate web applications into the native context of Android apps. It provides powerful mechanisms for bi-directional interactions between the native-end (Java) and the web-end (JavaScript) of an Android app. However, these interaction mechanisms are complicated and have induced various types of bugs. To mitigate the problem, various techniques have been proposed to detect WebView-induced bugs via dynamic analysis, which heavily relies on executing tests to explore WebView behaviors. Unfortunately, these techniques either require manual effort or adopt random test generation approaches, which are not able to effectively explore diverse WebView behaviors. In this paper, we study the problem of test generation for WebViews in Android apps. Effective test generation for WebViews requires identifying the essential program properties to be covered by the generated tests. To this end, we propose WebView-specific properties to characterize WebView behaviors, and devise a cross-language dynamic analysis method to identify these properties. We develop $\omega$Test, a test generation technique that searches for event sequences covering the identified WebView-specific properties. An evaluation on 74 real-world open-/closed-source Android apps shows that $\omega$Test can cover diverse WebView behaviors and detect WebView-induced bugs effectively. $\omega$Test detected 36 previously-unknown bugs. From the 22 bugs that we have reported to the app developers, 13 bugs were confirmed, 9 of which were fixed.

cs.SE

Hard Lefschetz theorems for free line bundles

We introduce a partial positivity notion for algebraic maps via the defect of semismallness. This positivity notion is modeled on $m$-positivity in the analytic setting and $m$-ampleness in the geometric setting. Using this positivity condition for algebraic maps, we establish K\"ahler packages, that is, Hard Lefschetz theorems and Hodge-Riemann bilinear relations, for the complete intersections of Chern classes of free line bundles.

math.AG

Intersection theoretic inequalities via Lorentzian polynomials

We explore the applications of Lorentzian polynomials to the fields of algebraic geometry, analytic geometry and convex geometry. In particular, we establish a series of intersection theoretic inequalities, which we call rKT property, with respect to $m$-positive classes and Schur classes. We also study its convexity variants -- the geometric inequalities for $m$-convex functions on the sphere and convex bodies. Along the exploration, we prove that any finite subset on the closure of the cone generated by $m$-positive classes can be endowed with a polymatroid structure by a canonical numerical-dimension type function, extending our previous result for nef classes; and we prove Alexandrov-Fenchel inequalities for valuations of Schur type. We also establish various analogs of sumset estimates (Pl\"{u}nnecke-Ruzsa inequalities) from additive combinatorics in our contexts.

math.AG