Search arXiv⌕ Search

SEARCH · Search arXiv

Search Search arXiv

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7Linked to original sources

Solver-Integrated Adversarial Attacking and Training of Neural Operators

Neural operators are widely used as fast surrogates for numerical PDE solvers, mapping input functions to solution functions. However, their generalizability and robustness are not yet clearly defined in the operator-learning setting, which differs from traditional adversarial robustness definitions. This paper studies the generalizability and robustness of a learned neural operator from a solver-integrated perspective, addressing the challenge that the output of a learned operator and a numerical solver tends to change in tandem under input perturbation. First, we formalize the definition of generalization and robustness through a model-solver error operator, identifying fixed-input model-solver loss as generalization metric, and norm-bounded adversarial attack loss increase and Jacobian-error function norm as robustness metric. Second, we identify the solver-integrated adversarial attack as appropriate for PDE operator learning and show why model-only or fixed-ground-truth attacks can be insufficient when the solver output also changes with the input. Third, we develop solver-integrated adversarial training methods for neural operators. Experiments on representative PDE benchmarks show that this solver-integrated adversarial training clearly improves both generalizability and robustness. Deeper solver integration yields more effective attacks, more informative samples, and more efficient training than less integrated alternatives. These results provide a general framework for robust operator training and automatic sample selection without heavy manual intervention. More broadly, the formulation applies to adversarial regression whenever a ground-truth oracle can evaluate, and ideally differentiate, the true input-output map; PDE operator learning is one such case.

cs.LG↗

Consumption-Investment Problem in Rank-Based Models

We study a consumption-investment problem in a multi-asset market where the returns follow a generic rank-based model. Our main results are an HJB equation with Neumann boundary conditions for the value function, together with a corresponding verification theorem. The control problem is nonstandard due to the discontinuous nature of the coefficients in rank-based models, requiring a bespoke approach of independent mathematical interest. The special case of first-order models, prescribing constant drift and diffusion coefficients for the ranked returns, admits explicit solutions when the investor (a) is unconstrained, (b) abides by open market constraints or (c) is fully invested in the market. The explicit optimal strategies in all cases are related to the celebrated solution to Merton's problem, despite case (b) being intractable in the classic Merton setting.

q-fin.MF↗

Light-sheet microscopy in cancer pathology: current applications, clinical challenges and future perspectives

Light-sheet fluorescence microscopy (LSFM) has emerged as a powerful research technology for three-dimensional (3D) visualization of biological tissues and is increasingly applied to human cancer specimens, including optically cleared biopsies and surgical resection samples. In this Perspective article, we review current applications of LSFM in oncology, and discuss how recent developments in microscopy, tissue preparation, labelling, and computational analysis are expanding the possibilities of 3D cancer pathology. Although LSFM has demonstrated the feasibility of large-volume imaging in selected human specimens, its application remains predominantly within research and translational settings and is not currently part of routine clinical pathology. We therefore distinguish demonstrated applications from potential future uses. We discuss how LSFM could eventually contribute to selected diagnostic and surgical workflows by providing 3D information on tumour architecture, spatial heterogeneity, metastatic dissemination, and surgical margins. These applications remain prospective and will require substantial technical, clinical, regulatory, computational, and workflow validation before clinical implementation can be considered. Ultimately, LSFM may complement rather than replace conventional histopathology by extending pathological assessment from two-dimensional tissue sections towards 3D spatial analysis.

physics.med-ph↗

Relative $\mathbb{A}^1$-Contractibility of Koras-Russell Prototypes and Exotic Motivic Spheres

The Koras-Russell threefolds are a certain family of smooth, affine contractible threefolds exhibiting "exotic" behavior in the algebro-geometric context. Our goal in this note is to extend its $\mathbb{A}^1$-contractibility from a field to a general base scheme. As a consequence, we also give a general strategy to extend the $\mathbb{A}^1$-contractibility of Koras-Russell prototypes in higher dimensions over a general base scheme. As a major consequence, we establish the existence of "exotic" motivic spheres in all dimensions at least 4 over infinite perfect fields.

math.AG↗

Quantum-inspired space-time PDE solver and dynamic mode decomposition

The numerical solution of time-dependent PDEs posed over the combined space-time domain, instead of treating time sequentially, leads to space-time methods. Treating time as another spatial dimension allows parallelization across time and simultaneous adaptivity in spatial and temporal discretizations. However, space-time formulations suffer from the curse of dimensionality due to the (d+1)-dimensional domain. Time-series forecasting methods, such as dynamic mode decomposition (DMD), also suffer the same scaling for storing and processing measurement data. In this work, we investigate whether quantum-inspired tensor network methods can mitigate this curse for both solving PDEs and data-driven modeling. We formulate a space-time matrix product state (MPS) encoding to represent either the space-time solution or time-series data. Using this representation, we develop a unified framework that combines an MPS space-time PDE solver with an MPS-DMD algorithm. We benchmark our MPS space-time solver for linear and nonlinear PDEs in both (1+1) and (2+1) dimensions, including non-diffusive regimes such as shockwave formation and Allen-Cahn phase separation. We observe that the MPS ansatz efficiently captures the spatio-temporal correlations of the solutions, with a 99% reduction in parameters with respect to the grid size. We demonstrate the MPS-DMD algorithm in two cases. First, the MPS space-time solver generates the MPS encoding of the time-series data. We then apply MPS-DMD directly to predict the dynamics without solving PDEs. Second, for the general case where data is available as dense arrays, MPS-DMD needs an intermediate compression step. We implement a streaming-like compression algorithm and observe a 97% reduction in memory, with MPS-DMD predictions matching those of exact DMD.

physics.comp-ph↗

LightPFP: A Lightweight Route to Ab Initio Accuracy at Scale

Machine learning interatomic potentials (MLIPs) bridge the gap between quantum-mechanical accuracy and scalable molecular simulations. However, a fundamental trade-off persists: universal MLIPs (u-MLIPs) offer broad transferability but are computationally expensive, whereas task-specific MLIPs (ts-MLIPs) achieve high efficiency at the expense of costly DFT training data. Here we introduce LightPFP, a data-efficient knowledge distillation framework. Instead of relying on expensive DFT calculations, LightPFP constructs a distilled ts-MLIP by using a u-MLIP to generate high-quality, material-specific training data, while employing a pre-trained lightweight model to further improve data efficiency. Across diverse material systems, LightPFP reduces model development time by approximately three orders of magnitude compared with DFT-based workflows, while maintaining DFT-level accuracy. Combined with a LAMMPS/Kokkos inference backend, LightPFP achieves more than three orders of magnitude higher inference efficiency than u-MLIP baselines while enabling simulations of systems thousands of times larger. When the teacher exhibits systematic bias, LightPFP supports few-shot precision correction using as few as 10 high-accuracy DFT configurations, as demonstrated by reproducing MgO's experimental melting point. This u-MLIP-driven distillation establishes a scalable route to high-fidelity, data-efficient MLIPs, accelerating the pace of materials discovery and design.

cond-mat.mtrl-sci↗

Phase-Space Shaping due to Betatron Cooling in Wakefield Accelerators and the Onset of the Ion-Channel Laser

Plasma-based accelerators are beginning to employ relativistic beams with unprecedented charge and ultrashort durations. These dense driver beams can drive wakes even in high-density plasmas ($\gtrsim10^{19}$ cm$^{-3}$), where betatron radiation becomes increasingly important and begins to affect the dynamics of the accelerated beam. We show that betatron cooling leads to a strong structuring of the phase space of the beam. This gives rise to bunched, ring-like structures with positive radial position and momentum gradients, \emph{i.e.}, population inversion of the amplitude of oscillation. We derive the characteristic timescales for this process analytically and confirm our predictions with multi-dimensional Particle-in-Cell simulations. The radiation-dominated regime of beam dynamics fundamentally alters the acceleration process and produces self-structured beams\reviewtwo{; Particle-in-Cell simulations of the resulting beams show that it becomes unstable to the ion-channel laser and lead to exponential amplification of radiation.

physics.acc-ph↗

Fractional Iterates and Oscillatory Convergence

The simple continued fractions for the Golden & Silver means are well-known. It is astonishing that, as far as we know, no one has published half-iterates (let alone quarter-iterates) for the corresponding algorithms. We also examine the cosine and logistic maps (with parameter $2 < λ< 3$).

math.NT↗

Statistical Inference for Matching Decisions via Matrix Completion under Dependent Missingness

This paper studies decision-making and statistical inference for two-sided matching markets via matrix completion. In contrast to the independent sampling assumed in classical matrix completion literature, the observed entries, which arise from past matching data, are constrained by matching capacity. This matching-induced dependence poses new challenges for both estimation and inference in the matrix completion framework. We propose a non-convex algorithm based on Grassmannian gradient descent and establish near-optimal entrywise convergence rates for three canonical mechanisms, i.e., one-to-one matching, one-to-many matching with one-sided random arrival, and two-sided random arrival. To facilitate valid uncertainty quantification and hypothesis testing on matching decisions, we further develop a general debiasing and projection framework for arbitrary linear forms of the reward matrix, deriving asymptotic normality with finite-sample guarantees under matching-induced dependent sampling. Our empirical experiments demonstrate that the proposed approach provides accurate estimation, valid confidence intervals, and efficient evaluation of matching policies.

stat.ME↗

Stochastic Optimal Control Problems for the Cost-Optimal Management of a Standalone Microgrid

In this paper, we consider a domestic standalone microgrid equipped with local renewable energy generation such as photovoltaic panels, consumption units, and battery storage to balance supply and demand and investigate the stochastic optimal control problem for its cost-optimal management. As a special feature, the manager does not have access to the power grid but has a local generator, making it possible to produce energy using fuel when needed. Such systems are very important for rural electrification, particularly in developing countries. However, these systems are very complex to control due to uncertainties in the weather and environmental conditions, which affect the energy generation and the energy demand. In addition, we assume that the battery and the fuel tank have limited capacities and that the fuel tank can only be filled once at the beginning of the planning period. This leads us to the so-called finite fuel problem. In addition, we allow the energy demand to not always be satisfied, and we impose penalties on unsatisfied demand, the so-called discomfort cost. The main goal is to minimize the expected aggregated cost of generating power using the generator and operating the system. This leads to a mathematical optimization problem. The problem is formulated as a discrete-time stochastic control problem and solved numerically using methods from the theory of Markov decision processes.

math.OC↗

Property (T) group factors whose Jones index set equals all positive integers

Using a mélange of techniques at the rich intersection of deformation/rigidity theory, finite index subfactor theory, and geometric group theory, we prove the existence of a continuum of property (T) factors that are pairwise non-stably isomorphic and whose Jones index sets consist of all positive integers. These factors are realized as group von Neumann algebras $\mathcal{L}(G)$ associated with property (T) generalized wreath-like product groups $G \in \mathscr{WR}(A, B \curvearrowright I)$ introduced in [CIOS23b], where $A$ is abelian, $B$ is a non-parabolic subgroup of a relatively hyperbolic group with residually finite peripheral structure, and $B \curvearrowright I$ is a faithful action with infinite orbits. Integer index subfactors of $\mathcal{L}(G)$ are constructed from extensions of $G$. This result advances an open question of P. de la Harpe [dlH95].

math.OA↗

Brownian motion and stochastic areas on complex partial flag manifolds with blocks of equal size

We construct a Brownian motion on complex partial flag manifolds with blocks of equal size as a matrix-valued diffusion from a Brownian motion on the unitary group. This construction leads to an explicit expression for the characteristic function of the joint distribution of the stochastic areas on these manifolds. The limit law of these stochastic areas is shown to be a multivariate Cauchy distribution with independent and identically distributed entries. By relating the area functionals on flag manifolds to the winding functional on the complex Stiefel manifold, we establish new results about simultaneous Brownian windings on the complex Stiefel manifold. To establish these results, this work introduces a new family of diffusions, which generalise both the Jacobi processes on the simplex and the Hermitian Jacobi processes.

math.PR↗

NeuroBridge: Bio-Inspired Self-Supervised EEG-to-Image Decoding via Cognitive Priors and Bidirectional Semantic Alignment

Visual neural decoding seeks to reconstruct or infer perceived visual stimuli from brain activity patterns, providing critical insights into human cognition and enabling transformative applications in brain-computer interfaces and artificial intelligence. Current approaches, however, remain constrained by the scarcity of high-quality stimulus-brain response pairs and the inherent semantic mismatch between neural representations and visual content. Inspired by perceptual variability and co-adaptive strategy of the biological systems, we propose a novel self-supervised architecture, named NeuroBridge, which integrates Cognitive Prior Augmentation (CPA) with Shared Semantic Projector (SSP) to promote effective cross-modality alignment. Specifically, CPA simulates perceptual variability by applying asymmetric, modality-specific transformations to both EEG signals and images, enhancing semantic diversity. Unlike previous approaches, SSP establishes a bidirectional alignment process through a co-adaptive strategy, which mutually aligns features from two modalities into a shared semantic space for effective cross-modal learning. NeuroBridge surpasses previous state-of-the-art methods under both intra-subject and inter-subject settings. In the intra-subject scenario, it achieves the improvements of 12.3% in top-1 accuracy and 10.2% in top-5 accuracy, reaching 63.2% and 89.9% respectively on a 200-way zero-shot retrieval task. Extensive experiments demonstrate the effectiveness, robustness, and scalability of the proposed framework for neural visual decoding.

cs.CV↗

Algebraic topology of $C^*$-algebras

Any $C^*$-algebra can be regarded as a generalization of locally compact, Hausdorff topological space $\mathcal X$. From the commutative Gelfand-Na\uımark theorem it follows that the spectrum of any commutative $C^*$-algebra is a locally compact, Hausdorff space which have the exact information about the $C^*$-algebra. Here we consider a Gelfand spaces of $C^*$-algebras which can be regarded as a generalization of the spectrum. In case of commutative $C^*$-algebras the Gelfand space coincides with the spectrum. Generally Gelfand spaces are not Hausdorff and provide more detailed information of noncommutative $C^*$-algebras. Usage of Gelfand spaces of $C^*$-algebra enables us to define some $C^*$-algebraic analogs of several notions of the classical algebraic topology, e.g. fundamental group, cohomology, multiplicative structure of $K$-theory and Adams operations. Application of the Gelfand spaces yields a generalization of Dixmier-Douady theory. Also Gelfand space provides interoperability between topological invariants and quantum logic.

math.OA↗

Pharos-ESG: A Framework for Multimodal Parsing, Contextual Narration, and Hierarchical Labeling of ESG Report

Environmental, Social, and Governance (ESG) principles are reshaping the foundations of global financial governance, transforming capital allocation architectures, regulatory frameworks, and systemic risk coordination mechanisms. However, as the core medium for assessing corporate ESG performance, the ESG reports present significant challenges for large-scale understanding, due to chaotic reading order from slide-like irregular layouts and implicit hierarchies arising from lengthy, weakly structured content. To address these challenges, we propose Pharos-ESG, a unified framework that transforms ESG reports into structured representations through multimodal parsing, contextual narration, and hierarchical labeling. It integrates a reading-order modeling module based on layout flow, hierarchy-aware segmentation guided by table-of-contents anchors, and a multi-modal aggregation pipeline that contextually transforms visual elements into coherent natural language. The framework further enriches its outputs with ESG, GRI, and sentiment labels, yielding annotations aligned with the analytical demands of financial research. Extensive experiments on annotated benchmarks demonstrate that Pharos-ESG consistently outperforms both dedicated document parsing systems and general-purpose multimodal models. In addition, we release Aurora-ESG, the first large-scale public dataset of ESG reports, spanning Mainland China, Hong Kong, and U.S. markets, featuring unified structured representations of multi-modal content, enriched with fine-grained layout and semantic annotations to better support ESG integration in financial governance and decision-making.

cs.AI↗

Understanding the Staged Dynamics of Transformers in Learning Latent Structure

Language models have proven to be capable of learning the intricate latent structures in language. However, the dynamics of how such models acquire the components of that structure remain poorly understood, leaving them open to the criticism that models just remix training data. In this work, we use the Alchemy benchmark as a controlled setting in which we investigate how models acquire the different latent structure components of the data. We train a small decoder-only transformer on three controlled task variants: 1) inferring missing steps from partial contextual information, 2) composing simple rules to solve multi-step sequences, and 3) decomposing complex multi-step examples to infer intermediate states. By factorizing each task into interpretable components, we show that the model learns the different latent structure components in discrete $\textit{stages}$ and in a $\textit{coarse-to-fine}$ manner. Using inference-time ablations, we demonstrate that when certain latent structures are masked or replaced, the model can use an alternative intermediate latent structure to solve the task. We also observe an asymmetry: the model composes single step transitions robustly, but struggles to decompose complex examples to discover the atomic steps. Our findings provide insight into $\textit{how}$ a transformer model acquires latent structure, offering a detailed view of how capabilities evolve during training.

cs.LG↗

Data-driven model order reduction for wave propagation in materials with damage and nonlinearities

In this work, we consider wave propagation in materials characterized by nonlinear properties or damage. To accelerate the simulations of the resulting high-dimensional problems, we apply model order reduction methods. Depending on the knowledge of the underlying equations and the availability of their discrete operators, intrusive methods (here projection-based approaches based on proper orthogonal decomposition (POD)) or non-instrusive methods (here data-driven approaches including dynamic mode decomposition (DMD) and operator inference (OpInf)) can be used. We recall the theoretical foundations of the methods and apply them to the problem of wave propagation. In three different numerical examples, we evaluate the performance of the reduction techniques.

math.NA↗

Structure is Supervision: Multiview Masked Autoencoders for Radiology

Building robust medical machine learning systems requires pretraining strategies that exploit the intrinsic structure present in clinical data. We introduce Multiview Masked Autoencoder (MVMAE), a self-supervised framework that leverages the natural multi-view organization of radiology studies to learn view-invariant and disease-relevant representations. MVMAE combines masked image reconstruction with cross-view alignment, transforming clinical redundancy across projections into a powerful self-supervisory signal. We further extend this approach with MVMAE-V2T, which incorporates radiology reports as an auxiliary text-based learning signal to enhance semantic grounding while preserving fully vision-based inference. Evaluated on a downstream disease classification task on three large-scale public datasets, MIMIC-CXR, CheXpert, and PadChest, MVMAE consistently outperforms supervised and vision-language baselines. Furthermore, MVMAE-V2T provides additional gains, particularly in low-label regimes where structured textual supervision is most beneficial. Together, these results establish the importance of structural and textual supervision as complementary paths toward scalable, clinically grounded medical foundation models.

cs.CV↗