SearcharxivSearch

arXiv subjects

Hamed Najafi

Publications and source records attributed to Hamed Najafi.

6 recordsLinked to original sources

Multi-Quantile Regression for Extreme Precipitation Downscaling

Deep super-resolution networks for precipitation downscaling achieve strong bulk skill yet systematically under-predict the heavy-tail events that drive flood risk. We demonstrate that the primary obstacle is the loss function, not the data: under intensity-weighted MAE, real and synthetic labels at the same input are simply averaged, meaning data augmentation shifts the predicted mean rather than the conditional distribution. We resolve this with Q-SRDRN, a multi-quantile super-resolution network trained with pinball loss at tau in 0.50, 0.95, 0.99, 0.999. Two CNN-specific design choices make this practical: IncrementBound enforces monotonicity while preserving each quantile channel's gradient identity, and separate per-quantile output heads provide independent filter banks for bulk and tail detection. Under this design, data augmentation via cVAE becomes complementary: the median head absorbs synthetic patterns without contaminating upper quantiles. Empirically, on Florida (convective/tropical-cyclone dominated), the un-augmented Q-SRDRN P999 head detects 1,598 of 2,111 events at 200 mm/day versus 88 for the deterministic baseline--an 18x detection-rate gain (4.2% to 75.7%)--with 63% lower KL divergence and 3.9% lower RMSE. Adding cVAE-generated samples lifts the P50 channel from 14 to 1,038 hits at 200 mm/day. On California (atmospheric-river dominated), the architecture reaches near-perfect detection (P999 SEDI >= 0.996 through 300 mm/day). On Texas, the baseline catches only 2 of 10,720 events at 200 mm/day while the P999 head catches 8,776 (81.9%). While the cVAE does not transfer across regions, multi-quantile regression captures extremes wherever the large-scale signal is strong, while augmentation rescues the median where it is not.

cs.LG

Feature-Function Curvature Analysis: A Geometric Framework for Explaining Differentiable Models

Explainable AI (XAI) is critical for building trust in complex machine learning models, yet mainstream attribution methods often provide an incomplete, static picture of a model's final state. By collapsing a feature's role into a single score, they are confounded by non-linearity and interactions. To address this, we introduce Feature-Function Curvature Analysis (FFCA), a novel framework that analyzes the geometry of a model's learned function. FFCA produces a 4-dimensional signature for each feature, quantifying its: (1) Impact, (2) Volatility, (3) Non-linearity, and (4) Interaction. Crucially, we extend this framework into Dynamic Archetype Analysis, which tracks the evolution of these signatures throughout the training process. This temporal view moves beyond explaining what a model learned to revealing how it learns. We provide the first direct, empirical evidence of hierarchical learning, showing that models consistently learn simple linear effects before complex interactions. Furthermore, this dynamic analysis provides novel, practical diagnostics for identifying insufficient model capacity and predicting the onset of overfitting. Our comprehensive experiments demonstrate that FFCA, through its static and dynamic components, provides the essential geometric context that transforms model explanation from simple quantification to a nuanced, trustworthy analysis of the entire learning process.

cs.LG

Operator mean inequalities and Kwong functions

In this paper, we study operator mean inequalities for the weighted arithmetic, geometric and harmonic means. We give a slight modification of Audenaert's result to show the relation between Kwong functions and operator monotone functions. Operator mean inequalities provide some analogs of the geometric concavity property for Kwong functions, operator convex, and operator monotone functions. Moreover, we give our points across by way of some examples which show the usage of our main results.

math.FA

A New Hybrid Method of IPv6 Addressing in the Internet of Things

Humans have always been seeking greater control over their surrounding objects. Today, with the help of Internet of Things (IoT), we can fulfill this goal. In order for objects to be connected to the internet, they should have an address, so that they can be detected and tracked. Since the number of these objects are very large and never stop growing, addressing space should be used, which can respond to this number of objects. In this regard, the best option is IPv6. Addressing has different methods, the most important of which are introduced in this paper. The method presented in this paper is a hybrid addressing method which uses EPC and ONS IP. The method proposed in this paper provides a unique and hierarchical IPv6 address for each object. This method is simple and does not require additional hardware for implantation. Further, the addressing time of this method is short while its scalability is high, and is compatible with different EPC standards.

cs.NI

Operator maps of Jensen-type

Let $\mathbb{B}_J(\mathcal H)$ denote the set of self-adjoint operators acting on a Hilbert space $\mathcal{H}$ with spectra contained in an open interval $J$. A map $Φ\colon\mathbb{B}_J(\mathcal H)\to {\mathbb B}(\mathcal H)_\text{sa} $ is said to be of Jensen-type if \[ Φ(C^*AC+D^*BD)\le C^*Φ(A)C+D^*Φ(B)D \] for all $ A, B \in B_J(\mathcal H)$ and bounded linear operators $ C,D $ acting on $ \mathcal H $ with $ C^*C+D^*D=I$, where $I$ denotes the identity operator. We show that a Jensen-type map on a infinite dimensional Hilbert space is of the form $Φ(A)=f(A)$ for some operator convex function $ f $ defined in $ J $.

math.FA

An extension of the Lowner-Heinz inequality

We extend the celebrated Löwner--Heinz inequality by showing that if $A, B$ are Hilbert space operators such that $A > B \geq 0$, then A^r - B^r \geq ||A||^r-(||A||- \frac{1}{||(A-B)^{-1}||})^r > 0 for each $0 < r \leq 1$. As an application we prove that \log A - \log B \geq \log||A||- \log(||A||-\frac{1}{||(A-B)^{-1}||})>0.

math.FA