AI conference papers

AI conference paper library

Search papers from 30+ top conferences, including NeurIPS, ICLR, ICML, CVPR, ACL and AAAI. Filter by keyword, then open any paper for its abstract, authors and links.

arXiv

WeCon: An Efficient Weight-Conditioned Neural Solver for Multi-Objective Combinatorial Optimization Problems

Xuan Wu, Jinbiao Chen, Yang Li, Lijie Wen, Chunguo Wu, Yuanshu Li, Yubin Xiao, Chunyan Miao, You Zhou, Di Wang

Existing neural solvers for Multi-Objective Combinatorial Optimization Problems (MOCOPs) commonly adopt decomposition-based strategies that scalarize a MOCOP into multiple subproblems associated with distinct weight vectors. However, they either inject weights only once during decoding, limiting weight-conditioned context modeling, or primarily during encoding, causing weight-signal dilution during decoding. Moreover, their preference optimization methods rely on purely random sampling to construct solution pairs for training solvers, which often produces less informative pairs and thus leads to low training effectiveness. To better address these limitations, we propose an efficient Weight-Conditioned neural solver (WeCon). Specifically, we design an encoder layer with three attention blocks and our proposed Gated Residual Fusion block to facilitate harmonious interaction between instance features and weights, thereby generating informative weight-conditioned context. We further introduce a plug-and-play Residual Fusion block in the decoder to alleviate weight-signal dilution. Finally, we propose Efficient Preference Optimization, which constructs high-quality solutions, thereby generating more informative pairs to improve training effectiveness. Experimental results on four MOCOP variants across different problem scales and distribution patterns demonstrate that WeCon achieves HyperVolume (HV) performance comparable to the state-of-the-art (SOTA) solver POCCO-W, while requiring approximately 40% less inference time. Moreover, the variant WeCon-CCO, which adopts an enhanced decoder, achieves the best overall HV performance with increased inference time. Ablation studies validate the contributions of all proposed designs.

arXiv

Predicting Channel Closures in the Lightning Network with Machine Learning

Simone Antonelli, Vincent Davis, Harrison Rush, Anthony Potdevin, Jesse Shrader, Vikash Singh, Emanuele Rossi

The Lightning Network (LN) is a second-layer protocol for Bitcoin designed to enable fast and cost-efficient off-chain transactions. Channels in the LN can be closed either by mutual agreement or unilaterally through a forced closure, which locks the involved capital for an extended period and degrades network reliability. In this paper, we study the problem of predicting channel closure types from publicly available gossip data, framing it as a temporal link classification task over the evolving channel graph. We construct a dataset spanning over two years of LN activity and benchmark a range of machine learning approaches, from MLPs to temporal graph neural networks and spectral encodings. Our experiments reveal that the dominant predictive signals are temporal and behavioural, namely how recently each endpoint was active and the per-node history of past closures, while the surrounding network topology provides no additional benefit. We find that a simple MLP operating on edge-level features, node-level event counts, and temporal patterns outperforms all graph-based approaches, and discuss how the inherent privacy of the LN, where critical information such as channel balances and payment flows remains hidden, fundamentally limits the predictability of closures from gossip data alone. We publicly release the dataset and code at https://github.com/AmbossTech/ln-channel-closure-prediction.

arXiv

Steering grids for sparse-autoencoder features: when a top-context label names an activation regime rather than a causal axis

Michael A. Riegler, Birk Sebastian Frostelid Torpmann-Hagen

The standard protocol for interpreting sparse-autoencoder (SAE) features labels each feature from its top-activating contexts and validates the label by steering that single feature at a typical magnitude. We argue that this inspects one cell of a larger steering grid, steering condition (single feature, joint feature set, matched random direction) crossed with steering coefficient, and show that other cells carry information that changes the label. On Qwen3-1.7B-Instruct and Gemma-2-2B-it, with the matched-geometry control extended to Llama-3.1-8B-Instruct: (1) features labelled AI self-disclaimer from their top contexts switch to a second surface form under steering, a contemplative voice on Qwen, a collective we-voice on Gemma, so the label names an activation regime, not the causal axis; two anchor features separate genuine mode switches from monotonic response and from breakdown. (2) Three near-orthogonal features that are individually substitutable are jointly necessary for grounded composition: joint suppression collapses unrelated control tasks into placeholder text that single-feature suppression at the same coefficient leaves intact. (3) A matched-geometry random-direction control shows the collapse is direction-pattern-dependent, not magnitude-dependent: at the same residual-stream distortion, feature directions damage unrelated tasks where magnitude-matched random directions do not, with non-overlapping 95% confidence intervals on all three models, including the one SAE trained on the model it is applied to.

arXiv

The Lattice Representation Hypothesis of Large Language Models

Bo Xiong

We propose the Lattice Representation Hypothesis of large language models: a symbolic backbone that grounds conceptual hierarchies and logical operations in embedding geometry. Our framework unifies the Linear Representation Hypothesis with Formal Concept Analysis (FCA), showing that linear attribute directions with separating thresholds induce a concept lattice via half-space intersections. This geometry enables symbolic reasoning through geometric meet (intersection) and join (union) operations, and admits a canonical form when attribute directions are linearly independent. Experiments on WordNet sub-hierarchies provide empirical evidence that LLM embeddings encode concept lattices and their logical structure, revealing a principled bridge between continuous geometry and symbolic abstraction. Datasets and code are open available at https://github.com/xiongbo010/lattice-representation-hypothesis.

arXiv

Corner Reflector Array Jamming Discrimination Using Multi-Dimensional Micro-Motion Features with Frequency Agile Radar

Jie Yuan, Lei Wang, Yanhao Wang, Yimin Liu

This paper introduces a robust discrimination method for distinguishing real ship targets from corner-reflector-array jamming with frequency-agile radar. The key idea is to exploit the multidimensional micro-motion signatures that separate rigid ships from non-rigid decoys. From Range-Velocity maps we derive two new hand-crafted descriptors-mean weighted residual (MWR) and complementary contrast factor (CCF) and fuse them with deep features learned by a lightweight CNN. An XGBoost classifier then gives the final decision. Extensive simulations show that the hybrid feature set consistently outperforms state-of-the-art alternatives, confirming the superiority of the proposed approach.

arXiv

Multi-agent DRL-based Lane Change Decision Model for Cooperative Platooning in Mixed Traffic

Zeyu Mu, Shangtong Zhang, B. Brian Park

Connected automated vehicles (CAVs) possess the ability to communicate and coordinate with one another, enabling cooperative platooning that enhances both energy efficiency and traffic flow. However, during the initial stage of CAV deployment, the sparse distribution of CAVs among human-driven vehicles reduces the likelihood of forming effective cooperative platoons. To address this challenge, this study proposes a hybrid multi-agent lane change decision model aimed at increasing CAV participation in cooperative platooning and maximizing its associated benefits. The proposed model employs the QMIX framework, integrating traffic data processed through a convolutional neural network (CNN-QMIX). This architecture addresses a critical issue in dynamic traffic scenarios by enabling CAVs to make optimal decisions irrespective of the varying number of CAVs present in mixed traffic. Additionally, a trajectory planner and a model predictive controller are designed to ensure smooth and safe lane-change execution. The proposed model is trained and evaluated within a microsimulation environment under varying CAV market penetration rates. The results demonstrate that the proposed model efficiently manages fluctuating traffic agent numbers, significantly outperforming the baseline rule-based models. Notably, it enhances cooperative platooning rates up to 26.2\%, showcasing its potential to optimize CAV cooperation and traffic dynamics during the early stage of deployment.

arXiv

A General Deep Learning Framework for Wireless Resource Allocation under Discrete Constraints

Yikun Wang, Yang Li, Yik-Chung Wu, Rui Zhang

While deep learning (DL)-based methods have achieved remarkable success in continuous wireless resource allocation, efficient solutions for problems involving discrete variables remain challenging. This is primarily due to the zero-gradient issue in backpropagation, the difficulty of enforcing intricate constraints with discrete variables, and the inability in generating solutions with non-same-parameter-same-decision (non-SPSD) property. To address these challenges, this paper proposes a general DL framework by introducing the support set to represent the discrete variables. We model the elements of the support set as random variables and learn their joint probability distribution. By factorizing the joint probability as the product of conditional probabilities, each conditional probability is sequentially learned. This probabilistic modeling directly tackles all the aforementioned challenges of DL for handling discrete variables. By operating on probability distributions instead of hard binary decisions, the framework naturally avoids the zero-gradient issue. During the learning of the conditional probabilities, discrete constraints can be seamlessly enforced by masking out infeasible solutions. Moreover, with a dynamic context embedding that captures the evolving discrete solutions, the non-SPSD property is inherently provided by the proposed framework. We apply the proposed framework to two representative mixed-discrete wireless resource allocation problems: (a) joint user association and beamforming in cell-free systems, and (b) joint antenna positioning and beamforming in movable antenna-aided systems. Simulation results demonstrate that the proposed DL framework consistently outperforms existing baselines in terms of both system performance and computational efficiency.

arXiv

AIFL: A Global Daily Streamflow Forecasting Model Using a Deterministic LSTM Pre-trained on ERA5-Land and Fine-tuned on IFS

Maria Luisa Taccari, Kenza Tazi, Oisín M. Morrison, Andreas Grafberger, Juan Colonese, Corentin Carton de Wiart, Christel Prudhomme, Cinzia Mazzetti, Matthew Chantry, Florian Pappenberger

Reliable global streamflow forecasting is essential for flood preparedness and water resource management, yet data-driven models often suffer from a performance gap when transitioning from historical reanalysis to operational forecast products. This paper introduces AIFL (Artificial Intelligence for Floods), a deterministic LSTM-based model designed for global daily streamflow forecasting. Trained on 18,588 basins curated from the Caravan dataset, AIFL utilises a two-stage transfer-learning strategy to bridge the reanalysis-to-forecast domain shift. The model is first pre-trained on 40 years of ERA5-Land reanalysis (1980-2019) to capture robust hydrological processes, then fine-tuned on operational Integrated Forecasting System (IFS) forecasts (2016-2019) to adapt to the specific error structures and biases of operational numerical weather prediction. Ablation experiments confirm that this two-stage approach outperforms both a naive IFS-only baseline and a mixed-forcing single-stage alternative. To our knowledge, this is the first global model trained end-to-end within the Caravan ecosystem. On an independent temporal test set (2021-2024), AIFL achieves high predictive skill with a median modified Kling-Gupta Efficiency (KGE') of 0.66 and a median Nash-Sutcliffe Efficiency (NSE) of 0.53. Benchmarking results show that AIFL achieves comparable accuracy to current state-of-the-art global systems. The model provides a streamlined and operationally robust baseline for the global hydrological community.

arXiv

Compressing LLMs with MoP: Mixture of Pruners

Bruno Lopes Yamamoto, Lucas Lauton de Alcantara, Victor Zacarias, Leandro Giusti Mugnaini, Keith Ando Ogawa, Lucas Pellicer, Rosimeire Pereira Costa, Edson Bollis, Anna Helena Reali Costa, Artur Jordao

The high computational demands of Large Language Models (LLMs) motivate methods that reduce parameter count and accelerate inference. In response, model pruning emerges as an effective strategy, yet current methods typically focus on a single dimension-depth or width. We introduce MoP (Mixture of Pruners), an iterative framework that unifies these dimensions. At each iteration, MoP generates two branches-pruning in depth versus pruning in width-and selects a candidate to advance the path. On LLaMA-2 and LLaMA-3, MoP advances the frontier of structured pruning, exceeding the accuracy of competing methods across a broad set of compression regimes. It also consistently outperforms depth-only and width-only pruning. Furthermore, MoP translates structural pruning into real speedup, reducing end-to-end latency by 39% at 40% compression. Finally, extending MoP to the vision-language model LLaVA-1.5, we notably improve computational efficiency and demonstrate that text-only recovery fine-tuning can restore performance even on visual tasks.

arXiv

Aortic Valve Disease Screening from PPG via Physiology-Guided Self-Supervised Learning

Jiaze Wang, Qinghao Zhao, Zizheng Chen, Zhejun Sun, Deyun Zhang, Yuxi Zhou, Shenda Hong

Aortic valve disease (AVD) represents a major public health burden, while its diagnosis relies on echocardiography, which is limited by cost and specialist expertise, restricting scalable screening and risk stratification. Existing portable sensing modalities are constrained by indirect representations or acquisition dependencies. In this context, photoplethysmography (PPG), a widely available optical signal capturing peripheral hemodynamic dynamics, provides a scalable physiological measurement. However, the scarcity of clinically labeled PPG data severely constrains the development of effective data-driven models. To address this limitation, we propose Physiology-Guided Self-Supervised Learning (PG-SSL), leveraging approximately 170,000 unlabeled UK Biobank PPG recordings. PG-SSL constructs physiologically derived pseudo-labels based on clinically motivated waveform phenotypes associated with aortic stenosis (AS) and aortic regurgitation (AR), enabling large-scale pretraining without AVD-specific labels. Following fine-tuning on a small labeled cohort, the model achieved AUROCs of 0.8025 for AS and 0.7669 for AR. Further analyses demonstrated robustness under clinical confounding and covariate-balanced evaluation, as well as significant longitudinal associations with incident AVD events. This study demonstrates the feasibility of PG-SSL for leveraging large-scale unlabeled physiological signals under clinically labeled data-scarce conditions. The proposed approach provides a useful strategy for improving low-cost PPG-based screening and risk enrichment for clinically recognized AVD.

arXiv

Risk reversal for least squares estimators under nested convex constraints

Omar Al-Ghattas

In constrained stochastic optimization, one expects that restricting the feasible set, provided it still contains the true parameter, should not increase the statistical risk of the corresponding projection estimator. We show that this intuition can fail, even in basic settings. We investigate this phenomenon in the Gaussian sequence model. Given a compact, convex set $Θ\subseteq \mathbb{R}^d$, one observes \[ Y = θ^\star + σZ, \qquad Z \sim N(0, I_d), \] and seeks to estimate an unknown $θ^\star \in Θ$. Here, the maximum likelihood estimator over $Θ$ coincides with the least squares estimator (LSE), given by the Euclidean projection of $Y$ onto $Θ$. We construct an explicit example exhibiting \emph{risk reversal}: for sufficiently large noise, there exist nested compact convex sets $Θ_S \subsetneq Θ_L$ and $θ^\star \in Θ_S$ such that the LSE constrained to $Θ_S$ has strictly larger squared-error risk than the LSE constrained to $Θ_L$. Moreover, we demonstrate that risk reversal can persist at the level of worst-case risk. Finally, we show that the phenomenon is not specific to Gaussian noise or squared-error risk, extending our results beyond both settings. We clarify this phenomenon by contrasting noise regimes. In the vanishing-noise limit, the risk is governed at first order by the statistical dimension of the tangent cone, and risk reversal cannot occur at the leading $σ^2$ scale. In the diverging-noise regime, the risk instead depends on the global geometry of the constraint sets, and the embedding of $Θ_S$ within $Θ_L$ can reverse the risk ordering. These results reveal a previously unrecognized failure mode of the LSE. They demonstrate that in sufficiently noisy settings, tightening a constraint can paradoxically degrade statistical performance.

arXiv

Decentralized Causal Discovery using Judo Calculus

Sridhar Mahadevan

We describe a theory and implementation of an intuitionistic decentralized framework for causal discovery using judo calculus, which is formally defined as j-stable causal inference using j-do-calculus in a topos of sheaves. In real-world applications -- from biology to medicine and social science -- causal effects depend on regime (age, country, dose, genotype, or lab protocol). Our proposed judo calculus formalizes this context dependence formally as local truth: a causal claim is proven true on a cover of regimes, not everywhere at once. The Lawvere-Tierney modal operator j chooses which regimes are relevant; j-stability means the claim holds constructively and consistently across that family. We describe an algorithmic and implementation framework for judo calculus, combining it with standard score-based, constraint-based, and gradient-based causal discovery methods. We describe experimental results on a range of domains, from synthetic to real-world datasets from biology and economics. Our experimental results show the computational efficiency gained by the decentralized nature of sheaf-theoretic causal discovery, as well as improved performance over classical causal discovery methods.

arXiv

Intuitionistic $j$-Do-Calculus in Topos Causal Models

Sridhar Mahadevan

In this paper, we generalize Pearl's do-calculus to an Intuitionistic setting called $j$-stable causal inference inside a topos of sheaves. Our framework is an elaboration of the recently proposed framework of Topos Causal Models (TCMs), where causal interventions are defined as subobjects. We generalize the original setting of TCM using the Lawvere-Tierney topology on a topos, defined by a modal operator $j$ on the subobject classifier $Ω$. We introduce $j$-do-calculus, where we replace global truth with local truth defined by Kripke-Joyal semantics, and formalize causal reasoning as structure-preserving morphisms that are stable along $j$-covers. $j$-do-calculus is a sound rule system whose premises and conclusions are formulas of the internal Intuitionistic logic of the causal topos. We define $j$-stability for conditional independences and interventional claims as local truth in the internal logic of the causal topos. We give three inference rules that mirror Pearl's insertion/deletion and action/observation exchange, and we prove soundness in the Kripke-Joyal semantics. A companion paper in preparation will describe how to estimate the required entities from data and instantiate $j$-do with standard discovery procedures (e.g., score-based and constraint-based methods), and will include experimental results on how to (i) form data-driven $j$-covers (via regime/section constructions), (ii) compute chartwise conditional independences after graph surgeries, and (iii) glue them to certify the premises of the $j$-do rules in practice

arXiv

Copula Based Fusion of Clinical and Genomic Machine Learning Risk Scores for Breast Cancer Risk Stratification

Agnideep Aich, Sameera Hewage, Md Monzur Murshed

Clinical and gene-expression models predict breast cancer outcomes, but simple linear fusion ignores dependence between their risk scores. Using METABRIC, we tested whether modeling the joint distribution of clinical and gene-expression scores improved stratification of 5-year cancer-specific mortality. We defined clinical and mRNA-expression predictor views, trained classifiers, and obtained out-of-fold probabilities through 5-fold cross-validation. The scores were transformed into pseudo-observations on (0,1)^2 and used to fit Gaussian, Clayton, Gumbel, and Frank copulas. The clinical model discriminated better than the gene-expression model (AUC 0.783 vs 0.721). Frank had the smallest goodness-of-fit statistic, with Gaussian performing similarly. Copula fusion did not improve ROC-AUC over the clinical model. However, joint score groups showed clear survival differences, with patients scoring high on both views having the poorest outcomes. Competing-risks analysis showed the same pattern for cancer-death incidence. We also conducted an external evaluation in independent TCGA data using shared predictors and a harmonized 5-year overall-mortality endpoint. Copula-fused, individual, and simple-fusion scores showed comparable discrimination with overlapping confidence intervals. All received the same METABRIC-based recalibration. No gene met the prespecified stability criterion under repeated cross-validated permutation importance, so gene-level findings were treated as exploratory. Copulas provide an explicit, interpretable description of dependence between clinical and gene-expression risk scores and support descriptive joint-group analyses. This methodological study does not establish superior prediction, validated clinical risk categories, or clinical utility.

arXiv

EGRA:Toward Enhanced Behavior Graphs and Representation Alignment for Multimodal Recommendation

Xiaoxiong Zhang, Xin Zhou, Zhiwei Zeng, Yongjie Wang, Zhiqi Shen

MultiModal Recommendation (MMR) systems have emerged as a promising solution for improving recommendation quality by leveraging rich item-side modality information, prompting a surge of diverse methods. Despite these advances, existing methods still face two critical limitations. First, they use raw modality features to construct item-item links for enriching the behavior graph, while giving limited attention to balancing collaborative and modality-aware semantics or mitigating modality noise in the process. Second, they use a uniform alignment weight across all entities and also maintain a fixed alignment strength throughout training, limiting the effectiveness of modality-behavior alignment. To address these challenges, we propose EGRA. First, instead of relying on raw modality features, it alleviates sparsity by incorporating into the behavior graph an item-item graph built from representations generated by a pretrained MMR model. This enables the graph to capture both collaborative patterns and modality aware similarities with enhanced robustness against modality noise. Moreover, it introduces a novel bi-level dynamic alignment weighting mechanism to improve modality-behavior representation alignment, which dynamically assigns alignment strength across entities according to their alignment degree, while gradually increasing the overall alignment intensity throughout training. Extensive experiments on five datasets show that EGRA significantly outperforms recent methods, confirming its effectiveness.

arXiv

Uncertainty Modeling for Multi-Objective RTA Interception with Distillation Acceleration

Gaoxiang Zhao, Ruinan Qiu, Xiaoting Wang, Pengpeng Zhao, Rongjin Wang, Zhangang Lin, Xiaoqiang Wang

Real-Time Auction (RTA) interception decides which incoming advertising requests reach downstream systems, and therefore controls the quality of the data those systems learn from. At JD.com, off-site advertising produces on the order of hundreds of billions of requests per day, and the RTA channel alone serves up to hundreds of millions of requests per minute. Filtering low-quality and fraudulent traffic at this scale requires estimating each request's value with calibrated confidence, which we treat as an uncertainty modeling problem. Two obstacles stand in the way. First, advertising labels are severely imbalanced: deals are rare, and we show both analytically and empirically that standard weight-based uncertainty degrades under such sparsity, collapsing onto predicted probability and adding no signal. Second, methods such as SWAG and Bayesian neural networks require multiple stochastic forward passes per request, making full-traffic scoring prohibitively expensive. We address both problems with UMDA, a multi-objective framework that shares uncertainty across funnel-correlated objectives, using the reliable uncertainty of a balanced metric to compensate for the degenerate uncertainty of sparse ones. We then distill the multi-pass teacher into a single-pass student that reproduces both aleatoric and epistemic uncertainty at roughly one-tenth of the inference cost. On JD e-commerce dataset and the public Criteo dataset, UMDA supplies more effective samples to downstream tasks, and the distilled student preserves this capability. In production, it scores the full traffic in a near-line pipeline that feeds an hourly blacklist for online interception; a seven-day A/B test on 5% of live traffic cuts the click fraud rate by 3.59% and raises CVR by 4.01% at a matched interception ratio while leaving converted users essentially unchanged, and the model has since been deployed to full traffic.

arXiv

Evo-DKD: Dual-Knowledge Decoding for Autonomous Ontology Evolution in Large Language Models

Vishal Raman, Vijai Aravindh R, Abhijith Ragav

Ontologies and knowledge graphs require continuous evolution to remain comprehensive and accurate, but manual curation is labor intensive. Large Language Models (LLMs) possess vast unstructured knowledge but struggle with maintaining structured consistency. We propose Evo-DKD, a novel dual-decoder framework for autonomous ontology evolution that combines structured ontology traversal with unstructured text reasoning. Evo-DKD introduces two parallel decoding streams within an LLM: one decoder generates candidate ontology edits (e.g., new concepts or relations) while the other produces natural-language justifications. A dynamic attention-based gating mechanism coordinates the two streams, deciding at each step how to blend structured and unstructured knowledge. Due to GPU constraints, we simulate the dual-decoder behavior using prompt-based mode control to approximate coordinated decoding in a single-stream mode. The system operates in a closed reasoning loop: proposed ontology edits are validated (via consistency checks and cross-verification with the text explanations) and then injected into the knowledge base, which in turn informs subsequent reasoning. We demonstrate Evo-DKD's effectiveness on use cases including healthcare ontology refinement, semantic search improvement, and cultural heritage timeline modeling. Experiments show that Evo-DKD outperforms baselines using structured-only or unstructured-only decoding in both precision of ontology updates and downstream task performance. We present quantitative metrics and qualitative examples, confirming the contributions of the dual-decoder design and gating router. Evo-DKD offers a new paradigm for LLM-driven knowledge base maintenance, combining the strengths of symbolic and neural reasoning for sustainable ontology evolution.

arXiv

Machine Learning for Cloud Detection in IASI Measurements: A Data-Driven SVM Approach with Physical Constraints

Chiara Zugarini, Cristina Sgattoni, Luca Sgheri

Cloud detection is fundamental for the interpretation and operational exploitation of hyperspectral infrared sounders, yet the capability of infrared radiances alone to provide reliable cloud information remains insufficiently assessed. We introduce the Cloud Identification Support Vector Machine (CISVM), a supervised framework for global clear and cloudy classification from Infrared Atmospheric Sounding Interferometer (IASI) Level 1C observations. The analysis spans four seasons and compares radiances and brightness temperatures, alternative spectral reductions, and stratifications by surface type and climate zone. Using AVHRR-derived IASI cloud labels for training, the classifier operates exclusively on hyperspectral infrared radiances and is evaluated against independent IASI and collocated MODIS observations. The best-performing configuration, based on radiances and principal component analysis, achieves 88.52 percent of agreement with the operational IASI cloud reference. The results show that infrared radiances alone can reproduce the large-scale behaviour of an operational cloud product while providing physically interpretable insight into the influence of surface properties, seasonality, and geography on cloud detection performance. The proposed framework provides an operational baseline for future hyperspectral infrared missions, including ESA's Far-infrared Outgoing Radiation Understanding and Monitoring (FORUM).

arXiv

Reconstruction of SINR Maps from Sparse Measurements using Group Equivariant Non-Expansive Operators

Lorenzo Mario Amorosa, Francesco Conti, Nicola Quercioli, Flavio Zabini, Tayebeh Lotfi Mahyari, Yiqun Ge, Patrizio Frosini

As sixth generation (6G) wireless networks evolve, accurate signal-to-interference-noise ratio (SINR) maps are becoming increasingly critical for effective resource management and optimization. However, acquiring such maps at high resolution is often cost-prohibitive, creating a severe data scarcity challenge. This necessitates machine learning (ML) approaches capable of robustly reconstructing the full map from extremely sparse measurements. To address this, we introduce a novel reconstruction framework based on Group Equivariant Non-Expansive Operators (GENEOs). Unlike data-hungry ML models, GENEOs are low-complexity operators that embed domain-specific geometric priors, such as translation invariance and rotational equivariance, directly into their structure. This provides a strong inductive bias, enabling effective reconstruction from very few samples. Our key insight is that for network management, preserving the topological structure of the SINR map, such as the geometry of coverage holes and interference patterns, is often more critical than minimizing pixel-wise error. We validate our approach on realistic ray-tracing-based urban scenarios, evaluating performance with both statistical metrics (mean squared error (MSE)) and, crucially, a topological metric (1-Wasserstein distance). Results show that our method achieves superior statistical and topological accuracy across diverse urban scenarios. Compared to the best-performing baselines, GENEO reduces MSE up to 45% and decreases the 1-Wasserstein distance up to 54%. Crucially, these performance gains are maintained even under the most extreme tested conditions, such as a 1% sampling rate with a 30% measurement error, and when measurements are spatially biased. This demonstrates the practical advantage of GENEOs for creating structurally accurate SINR maps that are more reliable for downstream network optimization tasks.

arXiv

Exact Evaluation of the Accuracy of Diffusion Models for Inverse Problems with Gaussian Data Distributions

Emile Pierret, Bruno Galerne

Used as priors for Bayesian inverse problems, diffusion models have recently attracted considerable attention in the literature. Their flexibility and high variance enable them to generate multiple solutions for a given task, such as inpainting, super-resolution, and deblurring. However, there is still a lack of understanding about how accurately these conditional diffusion algorithms perform conditional sampling. In this article, we investigate the errors induced by these models when applied to a Gaussian data distribution for which the score function is exactly known. Within this constrained context, we are able to precisely analyze the discrepancy between the theoretical resolution of inverse problems via conditional sampling and the practical distributions generated by conditional diffusion models. This is done by characterizing all the involved iterative Gaussian processes and by computing the exact Wasserstein distance between the distributions of the diffusion model samplers and the ideal conditional distribution associated with the inverse problem. Our findings allow for the comparison of two major algorithms from the literature, Deep Posterior Sampling (DPS) and Pseudo-inverse Guided Diffusion Models ($Π$GDM), and the introduction of the new paradigm Conditional Gaussian Diffusion Models (CGDM) that is shown to be more accurate for Gaussian data distributions.

Keep browsing

More papers from top AI conferences

30+ top conferences, by conference, year, and topic.