arXiv:2511.02152v2 Announce Type: replace
Abstract: Time series data is one of the most popular data modalities in critical domains such as industry and medicine. The demand for algorithms that not only exhibit high accuracy but also offer interpretability is crucial in such fields, as decisions made there bear significant consequences. In this paper, we present ProtoTSNet, a novel approach to interpretable classification of multivariate time series data, through substantial enhancements to the ProtoPNet architecture. Our method is tailored to overcome the unique challenges of time series analysis, including capturing dynamic patterns and handling varying feature significance. Central to our innovation is a modified convolutional encoder utilizing group convolutions, pre-trainable as part of an autoencoder and designed to preserve and quantify feature importance. We evaluated our model on 30 multivariate time series datasets from the UEA archive, comparing our approach with existing explainable methods as well as non-explainable baselines. Through comprehensive evaluation and ablation studies, we demonstrate that our approach achieves the best performance among ante-hoc explainable methods while maintaining competitive performance with non-explainable and post-hoc explainable approaches, providing interpretable results accessible to domain experts.
Science Journals
arXiv:2511.04848v2 Announce Type: replace
Abstract: We introduce a new paradigm for geometry denoising using prior knowledge about the surface normal vector. This prior knowledge comes in the form of a set of preferred normal vectors, which we refer to as label vectors. A segmentation problem is naturally embedded in the denoising process. The segmentation is based on the similarity of the normal vector to the elements of the set of label vectors. Regularization is achieved by a total variation term. We formulate a split Bregman (ADMM) approach to solve the resulting optimization problem. The vertex update step is based on second-order shape calculus. We present various examples including the denoising of an eroded medieval gravestone inscription.
arXiv:2511.05420v2 Announce Type: replace
Abstract: As smart grids evolve to meet growing energy demands and modern operational challenges, the ability to accurately predict faults becomes increasingly critical. However, existing AI-based fault prediction models struggle to ensure reliability in evolving environments where they are required to adapt to new fault types and operational zones. In this paper, we propose a continual learning (CL) framework in the smart grid context to evolve the model together with the environment. We design four realistic evaluation scenarios grounded in class-incremental and domain-incremental learning to emulate evolving grid conditions. We further introduce Prototype-based Dark Experience Replay (ProDER), a unified replay-based approach that integrates prototype-based feature regularization, logit distillation, and a prototype-guided replay memory. ProDER achieves the best performance among the tested CL techniques, with accuracy drops of up to 0.032 for fault type prediction and up to 0.033 for fault zone prediction across different scenarios. These results demonstrate the practicality of resource-efficient continual learning system that reduces the computational and storage burden of maintaining intelligent fault prediction services in evolving energy infrastructure.
arXiv:2601.16991v3 Announce Type: replace
Abstract: Adapting large pre-trained language models to downstream tasks often entails fine-tuning millions of parameters or deploying costly dense weight updates, which hinders their use in resource-constrained environments. Low-rank Adaptation (LoRA) reduces trainable parameters by factorizing weight updates, yet the underlying dense weights still impose high storage and computation costs. Magnitude-based pruning can yield sparse models but typically degrades LoRA's performance when applied naively. In this paper, we introduce SALR (Sparsity-Aware Low-Rank Representation), a novel fine-tuning paradigm that unifies low-rank adaptation with sparse pruning under a rigorous mean-squared-error framework. We prove that statically pruning only the frozen base weights minimizes the pruning error bound, and we recover the discarded residual information via a truncated-SVD low-rank adapter, which provably reduces per-entry MSE by a factor of $(1 - r/\min(d,k))$. To maximize hardware efficiency, we fuse multiple low-rank adapters into a single concatenated GEMM, and we adopt a bitmap-based encoding with a two-stage pipelined decoding + GEMM design to achieve true model compression and speedup. Empirically, SALR attains 50\% sparsity on various LLMs while matching the performance of LoRA on GSM8K and MMLU, reduces model size by $2\times$, and delivers up to a $1.7\times$ inference speedup.
arXiv:2601.17950v2 Announce Type: replace
Abstract: The space of task-agnostic feature upsampling has emerged as a promising area of research to efficiently create denser features from pre-trained visual backbones. These methods act as a shortcut to achieve dense features for a fraction of the cost by learning to map low-resolution features to high-resolution versions. While early works in this space used iterative upsampling approaches, more recent works have switched to cross-attention-based methods, which risk falling into the same efficiency scaling problems of the backbones they are upsampling. In this work, we demonstrate that iterative upsampling methods can still compete with cross-attention-based methods; moreover, they can achieve state-of-the-art performance with lower inference costs. We propose UPLiFT, an architecture for Universal Pixel-dense Lightweight Feature Transforms. We also propose an efficient Local Attender operator to overcome the limitations of prior iterative feature upsampling methods. This operator uses an alternative attentional pooling formulation defined fully locally. We show that our Local Attender allows UPLiFT to maintain stable features throughout upsampling, enabling state-of-the-art performance with lower inference costs than existing pixel-dense feature upsamplers. In addition, we apply UPLiFT to generative downstream tasks and show that it achieves competitive performance with state-of-the-art Coupled Flow Matching models for VAE feature upsampling. Altogether, UPLiFT offers a versatile and efficient approach to creating denser features.
arXiv:2607.17480v1 Announce Type: new
Abstract: Blind recognition of polar codes from noisy observations is a key problem in non-cooperative signal processing. Although existing blind successive cancellation list (BSCL) recognition exploits channel soft information, it performs two-hypothesis path expansion at every source-bit position, resulting in high complexity. In this paper, we first analyze the first recognition-error positions in the blind successive cancellation (BSC) recognition and observe that they are closely related to the corresponding contribution terms in the existing Bhattacharyya-parameter-based upper bounds. Based on this observation, a critical-set-aided simplified blind successive cancellation list (SBSCL) recognition method is proposed. SBSCL performs two-hypothesis path expansion only at the selected critical-set positions and keeps BSC recognition at the remaining positions, thereby reducing complexity. To improve the reliability of critical-set selection and refine the performance analysis, density-evolution (DE)-based bounds are further developed. Under the ideal SC-consistent condition, the synthetic log-likelihood-ratio (LLR) distributions obtained from density evolution are used to compute the optimized Chernoff coefficient for the upper bound and the overlap coefficient for the lower bound. Simulation results show that the DE-based bounds are tighter than the Bhattacharyya-parameter-based bounds. In the considered settings, the gap between the DE upper and lower bounds is within $1$ dB around a recognition-error probability of $10^{-2}$. Furthermore, SBSCL achieves nearly the same recognition success rate as BSCL, and the size of critical set decreases rapidly as the signal-to-noise ratio (SNR) increases.
arXiv:2509.24511v2 Announce Type: replace
Abstract: Retractions have increased sharply in recent years, alongside a growing number of papers that receive post-publication comments questioning their reliability (commented papers). Together, retracted and commented papers undermine the credibility of scientific research and may also threaten public health. In this study, we examine problematic papers in the field of non-coding RNA (ncRNA) from multiple perspectives to identify common patterns and inform strategies for addressing large-scale fraudulent publications. We find that studies on under-investigated ncRNAs are more likely to become problematic papers. These papers often show substantial textual similarity, and many additional papers with similar text also display suspicious image duplication. Healthcare institutions, particularly those with lower publication output, appear especially vulnerable to producing such papers. Most problematic papers are concentrated in a small set of journals, many of which do not adequately address concerns raised after publication. Overall, our findings indicate that a substantial number of problematic papers may remain undetected and that their shared characteristics can support more effective strategies for identifying and curbing large-scale fraudulent publications.
arXiv:2601.18823v4 Announce Type: replace
Abstract: Variational autoencoders (VAE) encode data into lower-dimensional latent vectors before decoding those vectors back to data. Once trained, one can hope to detect out-of-distribution (abnormal) latent vectors, but several issues arise when the latent space is high dimensional. This includes an exponential growth of the hypervolume with the dimension, which severely affects the generative capacity of the VAE. In this paper, we draw insights from high dimensional statistics: in these regimes, the latent vectors of a standard VAE are distributed on the `equators' of a hypersphere, challenging the detection of anomalies. We propose to formulate the latent variables of a VAE using hyperspherical coordinates, which allows compressing the latent vectors towards a given direction on the hypersphere, thereby allowing for a more expressive approximate posterior. We show that this improves both the fully unconditional-OOD and conditional-OOD anomaly detection ability of the VAE, achieving the best performance on the datasets we considered, outperforming existing methods. For the unconditional-OOD and conditional-OOD modalities, respectively, these are: i) detecting unusual landscape from the Mars Rover camera and unusual Galaxies from ground based imagery (complex, real world datasets); ii) standard benchmarks like Cifar10 and subsets of ImageNet as the in-distribution (ID) class.
arXiv:2607.17519v1 Announce Type: new
Abstract: Classical paintings preserve rich spatial, cultural, and historical content, making their reconstruction as explorable 3D scenes valuable for digital preservation, immersive exhibition, and cultural engagement. Yet, unlike photographs, they often depict scenes in a single-view, stylized manner, with weak perspective, lighting, and depth cues. Existing 3D reconstruction methods are largely built on natural-image priors, making it difficult to recover geometrically plausible and visually faithful 3D representations from such inputs. To address this challenge, we introduce Classical Painting-to-3D (CP3D), a new task that aims to recover a 3D representation from a single classical painting while jointly ensuring geometric plausibility, appearance fidelity to the source artwork, and plausible novel-view synthesis. We further propose GeAR, a training-free two-stage framework for Geometry Grounding and Appearance Restitution. GeAR first converts the input painting into a geometry-grounded representation with more coherent shading and illumination cues, improving the stability of 3D Gaussian reconstruction. It then restores artwork-faithful appearance across views under spatial constraints and multi-view consistency, recovering the painterly textures and details weakened during grounding. In addition, we construct HeriArch, a curated benchmark of 10,160 high-resolution classical artworks for systematic evaluation of CP3D. Extensive experiments and user studies show that GeAR consistently outperforms strong baselines in geometric plausibility, appearance fidelity, and human preference. Code and dataset will be released publicly.
arXiv:2410.18777v1 Announce Type: cross
Abstract: This research presents an online path planner for Unmanned Aerial Vehicles (UAVs) that can handle dynamic obstacles and UAV motion constraints, including maximum curvature and desired orientations. Our proposed planner uses a NURBS path representation and a Differential Evolution algorithm, incorporating concepts from the Velocity Obstacle approach in a constraint function. Initial results show that our approach is feasible and provides a foundation for future extensions to three-dimensional (3D) environments.
arXiv:2503.20813v3 Announce Type: cross
Abstract: This work presents an equivalent circuit model for Magnetic Tunnel Junctions (MTJs) that accurately captures their magnetization dynamics and electrical behavior. Implemented in LTspice, the model is validated against direct numerical solutions of the Landau-Lifshitz-Gilbert-Slonczewski (LLGS) equation. It effectively simulates essential spintronic phenomena, including ferromagnetic resonance, field- and spin-torque-induced switching, and spin-torque-induced oscillations. Simulation results demonstrate strong agreement between LTspice and LLGS solutions, confirming the model accuracy and utility for efficient circuit-level analysis of spintronic devices. The ability to incorporate time-dependent magnetic fields and voltage inputs makes the proposed model suitable for diverse applications such as neuromorphic computing, microwave signal processing, and spintronic memory technologies. By providing a computationally efficient yet physically accurate circuit representation, this work enables seamless integration of MTJs into larger electronic systems, potentially accelerating the development of advanced spintronic circuit architectures.
arXiv:2607.16225v1 Announce Type: cross
Abstract: Brain-Computer Interfaces (BCIs) face a severe calibration bottleneck due to cross-subject spatial covariance shifts and physiological artifacts. To enable zero-calibration BCI, a deep learning pipeline was engineered combining Per-Session Independent Component Analysis, Riemannian Euclidean Alignment, and EEGNet stabilized by Stochastic Weight Averaging (SWA). Evaluated on the strict MOABB BNCI2014-001 benchmark, the proposed architecture successfully isolates true sensorimotor rhythms. For the primary case study (Subject 1), a clinically robust SWA stable accuracy of 90.97% (AUC: 0.976, Cohen's $\kappa$: 0.819) was achieved. Furthermore, expanded 9-fold Leave-One-Subject-Out (LOSO) cross-validation yielded a globally stable mean accuracy of 74.31%, proving hardware-agnostic zero-shot efficacy for binary motor imagery.
arXiv:2607.17351v1 Announce Type: new
Abstract: DeeperRadar is a radar-centric, sensor-stack-conditioned framework that co-designs radar sensing and multi-modal 3D detection for autonomous mobility by learning a sparse acquisition pattern end-to-end with the fusion model. A learnable MIMO design module is trained end-to-end within a fusion network that operates directly on raw radar ADC data together with camera images and LiDAR point clouds. During training, the design module is supervised by the other sensors, enabling the system to learn both which receiver antennas to activate and the effective number of them. At deployment, the design module is removed and replaced by the learned sparse subsampling mask, leaving the downstream model architecture unchanged. Evaluated on the RADIal dataset, DeeperRadar discovers sparse, task-aware radar configurations that match or exceed full-array baselines while using fewer receivers, potentially reducing radar cost and integration complexity. These results show that learned optimal MIMO radar design depends on the fusion stack and the downstream perception task.
arXiv:2607.17457v1 Announce Type: new
Abstract: The Hypencoder is a recently-proposed retrieval approach that encodes queries as shallow neural networks ("Q-Nets") that estimate relevance over pre-computed document embeddings. Inspired by Matryoshka Representation Learning, we show that the Hypencoder can be extended to support multiple sizes of Q-Nets, allowing trade-offs between effectiveness and efficiency when deployed. We find that this "Matryoshka Hypencoder" achieves comparable in-domain effectiveness with approximately 7x fewer active parameters in-domain and half as many active parameters out-of-domain, which corresponds to a 1.6-3.4x increase in scoring throughput. This work paves the way for practical deployment of Hypencoders.
arXiv:2607.17902v1 Announce Type: new
Abstract: Knowledge Organization Systems like Ontologies and taxonomies are fundamental for structuring scientific knowledge, yet their manual curation presents a persistent bottleneck in knowledge management. While Large Language Models (LLMs) offer a scalable mechanism for automated ontology generation, their capacity to classify complex, domain-specific semantics requires systematic evaluation. In this paper, we assess the performance of five small, open-source LLMs (up to 9 billion parameters) in identifying semantic relationships between biomedical concepts. To support this evaluation, we introduce MeSH-Rel-4K, a dataset comprising 4K semantic relationships extracted from the Medical Subject Headings (MeSH). We analyse three adaptation strategies: standard prompting, Chain-of-Thought prompting, and fine-tuning. While parameter-constrained models traditionally struggle with the nuances of in-context logic, our results reveal that targeted fine-tuning increases the average F1-score by 34.1 percentage points. These results confirm that direct fine-tuning effectively exceeds the reasoning bottlenecks of smaller LLMs, providing an accurate, automated methodology for the construction and evolution of specialised biomedical ontologies.
arXiv:2510.01483v3 Announce Type: replace
Abstract: Vision-language models (VLMs) demonstrate strong image-level scene understanding, but reasoning over long egocentric video remains costly: because VLMs maintain no persistent memory or explicit spatial representation, all sampled frames must be re-processed for every new query. We present VL-KnG, a training-free framework that constructs spatiotemporal knowledge graphs from monocular egocentric video, bridging fine-grained scene graphs and global topological graphs without 3D reconstruction. VL-KnG processes video in chunks, maintains persistent object identities via large language model (LLM)-based Spatiotemporal Object Association (STOA), and answers questions through Graph-Enhanced Retrieval (GER), which combines subgraph retrieval with visual grounding. Once constructed, the knowledge graph removes the need to revisit raw video at query time, decoupling query latency from video length. Across three embodied question answering benchmarks -- OpenEQA, NaVQA, and our newly introduced WalkieKnowledge -- VL-KnG achieves accuracy competitive with frontier VLMs while answering queries at substantially lower latency and with explainable, graph-grounded reasoning; it further surpasses prior persistent-representation baselines and open-weight VLMs in several settings. Deployment on a real robot demonstrates practical applicability, with query latency remaining stable as observation history grows. As a persistent, queryable scene memory, VL-KnG provides a concrete substrate for memory maintenance and knowledge updating in embodied AI agents.
arXiv:2509.02522v3 Announce Type: replace
Abstract: Recent advances in Reinforcement Learning with Verifiable Rewards (RLVR) have empowered large language models (LLMs) to tackle challenging reasoning tasks such as mathematics and programming, however existing RLVR methods often suffer from sparse reward signals and unstable policy gradient updates inherent to RL-based approaches. To address the challenges, we propose PACS, a novel RLVR framework that achieves imPlicit Actor Critic coupling via a Supervised learning framework. By treating the outcome reward as a predictable label, we reformulate the RLVR problem into a supervised learning task over a score function parameterized by the policy model and optimized using cross-entropy loss. A detailed gradient analysis shows that this supervised formulation inherently recovers the classical policy gradient update while providing more stable and efficient training. Extensive experiments demonstrate that PACS significantly outperforms strong open-source models and RLVR baselines, yielding substantial average gains of +8.26% (4B) and +9.57% (8B) over base models offering a promising avenue for LLMs post-training with verifiable rewards. Our code and data are available as open source at https://github.com/ritzz-ai/PACS.
arXiv:2607.17959v1 Announce Type: new
Abstract: Onshore wind is expected to supply much of the growth in renewables, yet its expansion increasingly extends into forests, where wind generation and forest conservation act as competing climate strategies for the same land. Net-zero system assessments typically treat forests homogeneously. Here, we grade forest exclusions by ecological value and couple them with a high-resolution net-zero electricity system model, representing onshore wind on forested and non-forested land as two distinct technologies. Applying a set of ecologically graded scenarios to Norway, we quantify how forest protection by its ecological value reshapes system design, the balance of onshore wind within and outside forests, and the robustness of these outcomes to complementary energy policy levers. At equal cost, the system treats forest as its preferred onshore resource, with forest wind comprising 60 to 90 percent of onshore capacity under permissive scenarios. Excluding forest raises system cost by up to 0.5 percent per GW of foregone forest wind, with diminishing returns as ecological criteria for forest exclusions tighten. Directing wind into forests does not compromise system efficiency, with onshore curtailment remaining largely unchanged at 3 to 8 percent. Land-use and technology decisions that appear independent may, in fact, interact, as solar deployment reshapes the value of each wind resource and determines which is displaced from the generation mix. By quantifying the ecological value forgone per unit of forest onshore wind, this study makes explicit a trade-off that energy system modelling usually leaves implicit, providing a transferable basis for balancing the competing climate strategies of protecting forests and sustaining wind expansion.
arXiv:2607.17931v1 Announce Type: new
Abstract: We extend the algorithmic framework of progressive exploration [Fabia\'nski et al., STACS 2019], which yields simple, yet surprisingly general and efficient parameterized algorithms for Dominating Set, Independent Set, and some of their variants. While they identified stability and the Helly property as necessary for their approach, we show that -- with a simple change -- in the case of Dominating Set, one can get rid of the stability requirement. This yields a fixed-parameter tractable algorithm on exactly those graph classes which do not contain long co-matchings or double-ladders as semi-induced subgraphs. Lifting one of these two restrictions makes Dominating Set W[1]-hard on these classes. Our algorithm generalizes results on weakly $\gamma$-closed graphs, and results from Sparsity theory, e.g., nowhere dense and biclique-free classes. At the same time, we match the time complexity of the previously known algorithms on those classes. We demonstrate that this technique can easily be applied to the Distance-$r$ Dominating Set and the Set Cover problem.
arXiv:2510.23614v2 Announce Type: replace
Abstract: One of the major starting points of discrete optimization is the theorem of Nash-Williams and Tutte on the existence of $k$ disjoint spanning trees of a graph, along with its counterpart on the existence of $k$ forests covering all edges of the graph. These elegant results triggered comprehensive research that gave rise to far-reaching generalizations and found applications in seemingly distant areas. Our first goal is to elucidate some aspects of these developments with the hope that the story finds its way to non-experts. But we hope that experts will also find some novelty in our exposition.
arXiv:2510.05969v3 Announce Type: replace
Abstract: Large language models (LLMs) are increasingly deployed on complex reasoning tasks, yet little is known about their ability to internally evaluate problem difficulty, which is an essential capability for adaptive reasoning and efficient resource allocation. In this work, we investigate whether LLMs implicitly encode problem difficulty in their internal representations. Using a linear probe on the final-token representations of LLMs, we demonstrate that the difficulty level of math problems can be linearly modeled. We further locate the specific attention heads of the final Transformer layer: these attention heads have opposite activation patterns for simple and difficult problems, thus achieving perception of difficulty. Our ablation experiments prove the accuracy of the location. Crucially, our experiments provide practical support for using LLMs as automatic difficulty annotators, potentially substantially reducing reliance on costly human labeling in benchmark construction and curriculum learning. We also uncover that there is a significant difference in entropy and difficulty perception at the token level. Our study reveals that difficulty perception in LLMs is not only present but also structurally organized, offering new theoretical insights and practical directions for future research. Our code is available at https://github.com/Aegis1863/Difficulty-Perception-of-LLMs.
arXiv:2601.21372v3 Announce Type: replace
Abstract: We present NEMO, a system that translates Natural-language descriptions of decision problems into formal Executable Mathematical Optimization implementations using autonomous coding agents (ACAs). Existing approaches rely on specialized large language models (LLMs) or bespoke task-specific agents that are often brittle and frequently generate syntactically invalid or non-executable code. NEMO instead treats ACAs as a first-class abstraction analogous to API-based interaction with LLMs; their sandboxed execution guarantees code is executable by construction and supports automated validation and repair. We introduce novel coordination patterns including asymmetric validation loops between independently generated optimizer and simulator implementations, external memory for experience reuse, and robustness enhancements via minimum Bayes risk (MBR) decoding and self-consistency. Across nine established optimization benchmarks, NEMO achieves state-of-the-art performance on the majority of tasks with substantial margins on several datasets, demonstrating the power of execution-aware agentic architectures for automated optimization modeling.
arXiv:2601.21428v2 Announce Type: replace
Abstract: In this work (Part I), we study three time-discretization schemes for the Dynamical Low-Rank Approximation (DLRA) of high-dimensional stochastic differential equations (SDEs). Specifically, we consider the Dynamically Orthogonal (DO) method for DLRA proposed and analyzed in arXiv:2308.11581v4, which approximates the true solution by a linear combination of few products between deterministic orthonormal modes and stochastic modes, both time-dependent. The first scheme considered consists in a forward discretization in time of both deterministic and stochastic components, in a Euler-Maruyama style. Its convergence is proven subject to a time-step restriction dependent on the smallest singular value of the Gram matrix associated to the stochastic modes, which, on its turn, is shown to be always positive, provided that the SDE under study is driven by a non-degenerate noise. The second and the third schemes, on the other hand, are staggered ones, alternating updates of the deterministic and the stochastic modes in half steps, and have a projector splitting nature. We show stability of the second scheme and prove convergence with constants independent of the smallest singular value. The third scheme works better in practice, although our theoretical convergence bounds are worse than those for the second one. Computational experiments support our theoretical results. In this work we do not consider the discretization in probability, which will be the topic of Part II.
arXiv:2602.02025v2 Announce Type: replace
Abstract: ML models critically depend on feature quality, yet in real-world settings, useful features are often distributed across multiple relational tables rather than a single dataset. Feature augmentation addresses this problem by automatically discovering and joining additional tables to enrich a base table with predictive features. However, scaling feature augmentation to complex schemas with many tables and multi-hop relationships is challenging. It requires exploring a large space of join paths, executing costly joins, and selecting useful features from noisy results. Existing approaches suffer from either limited effectiveness or efficiency. Restricting exploration to simple joins limits predictive performance, while more expressive methods rely on expensive training data, lack scalability, or fail to fully exploit schema-level semantics. We present Hippasus, a cost-aware, LLM-augmented feature discovery framework over relational schemas that addresses these challenges. Hippasus combines lightweight statistical signals with adaptive semantic reasoning, invoking stronger (LLM-based) analysis only when necessary. It further introduces efficient multi-way join execution with cross-path feature consolidation, and a hybrid feature selection strategy that integrates statistical relevance with semantic refinement. Experiments on real-world datasets show that Hippasus improves feature augmentation accuracy by up to 26.8% over state-of-the-art methods, while achieving a favorable effectiveness-cost tradeoff.
arXiv:2512.05610v2 Announce Type: replace
Abstract: Laser scanning has proven to be an invaluable tool in assessing the decomposition of forest environments. Mobile laser scanning (MLS) has shown to be highly promising for extremely accurate, tree level inventory. In this study, we present NormalView, a projection-based deep learning method for classifying tree species from point cloud data. NormalView embeds local geometric information into two-dimensional projections, in the form of normal vector estimates, and uses the projections as inputs to an image classification network, YOLOv11. In addition, we inspected the effect of multispectral radiometric intensity information on classification performance. We trained and tested our model on high-density MLS data (7 species, ~5000 pts/m2), as well as high-density airborne laser scanning (ALS) data (9 species, >1000 pts/m2). On the MLS data, NormalView achieves an overall accuracy (macro-average accuracy) of 95.5 % (94.8 %), and 91.8 % (79.1 %) on the ALS data. We found that having intensity information from multiple scanners provides benefits in tree species classification, and the best model on the multispectral ALS dataset was a model using intensity information from all three channels of the multispectral ALS. This study demonstrates that projection-based methods, when enhanced with geometric information and coupled with state-of-the-art image classification backbones, can achieve exceptional results. Crucially, these methods rely only on geometric information, and thus are compatible with most sensors. Additionally, we publically release the MLS dataset used in the study, containing 1915 samples.