Search arXiv⌕ Search

arXiv subjects

Search papers

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

At least 1,657 records · Page 92Linked to original sources

The smallest singular value for rectangular random matrices with Lévy entries

Let $X=(x_{ij})\in\mathbb{R}^{N\times n}$ be a rectangular random matrix with i.i.d. entries (we assume $N/n\to\mathbf{a}>1$), and denote by $σ_{min}(X)$ its smallest singular value. When entries have mean zero and unit second moment, the celebrated work of Bai-Yin and Tikhomirov show that $n^{-\frac{1}{2}}σ_{min}(X)$ converges almost surely to $\sqrt{\mathbf{a}}-1.$ However, little is known when the second moment is infinite. In this work we consider symmetric entry distributions satisfying $\mathbb{P}(|x_{ij}|>t)\asymp t^{-α}$ for some $α\in(0,2)$, and prove that $σ_{min}(X)$ can be determined up to a log factor with high probability: for any $D>0$, with probability at least $1-n^{-D}$ we have $$C_1n^{\frac{1}α}(\log n)^\frac{2(α-2)}α\leq σ_{min}(X)\leq C_2n^{\frac{1}α}(\log n)^\frac{α-2}{2α}$$ for some constants $C_1,C_2>0$. The upper bound was derived in a recent work of Bao, Lee and Xu \cite{bao2024phase2} but the lower bound is new and answers a problem posed in that paper in a weaker form. This appears to be the first determination of $σ_{min}(X)$ in the $α$-stable case with a correct leading order of $n$, as previous anti-concentration arguments only yield lower bound $n^\frac{1}{2}$. The same lower bound holds for $σ_{min}(X+B)$ for any fixed rectangular matrix $B$ with no assumption on its operator norm. The case of diverging aspect ratio is also computed.

math.PR↗

Bayesian nonparametric mixtures of Archimedean copulas

Copula-based dependence modeling often relies on parametric formulations. This is mathematically convenient, but can be statistically inefficient when the parametric families are not suitable for the data and model in focus. A Bayesian nonparametric mixture of Archimedean copulas is introduced to increase the flexibility of copula-based dependence modeling. Specifically, the Poisson-Dirichlet process is used as a mixing distribution over the Archimedean copulas' parameter. Properties of the mixture model are studied for the main Archimedean families, and posterior distributions are sampled via their full conditional distributions. The performance of the model is illustrated via numerical experiments involving simulated and real data.

stat.ME↗

Parameter-Specific Bias Diagnostics in Random-Effects Panel Data Models

The Hausman specification test assesses the random-effects specification by comparing random-effects and fixed-effects estimators. This note shows how a coefficient-specific diagnostic for linear mixed models can complement that comparison. The diagnostic measures alignment between fitted random effects and the weights used to estimate a coefficient or contrast. It is an internal sensitivity summary, not an estimate of every contribution to finite-sample bias: response-dependent covariance estimates introduce an additional weighted-error term. We explain this distinction, describe simulations that refit the covariance parameters and retain both contributions, and illustrate the calculations with gasoline-demand data and a multiple-membership value-added model. A covariance-scale analysis of the gasoline example connects the local diagnostic to movement toward the fixed-effects estimate. We also discuss how conditioning on stochastic regressors extends the interpretation, and what further assumptions would be needed for calibrated inference.

stat.ME↗

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization

This paper addresses nonconvex optimization problems via a two-level smoothing framework, where the high-order Moreau envelope (HOME) provides a smooth approximation of weakly convex cost functions. We study the differentiability and weak smoothness of HOME. Building on the inexact two-level smoothing optimization framework (ItsOPT), we propose an inexact two-level smoothing descent algorithm (ItsDEAL) by: (i) approximately solving the proximal subproblem to obtain an inexact first-order oracle for HOME at the lower level; and (ii) applying an inexact first-order method at the upper level. We derive computable sufficient conditions for lower-level inexactness, enabling approximate high-order proximal-points to be certified without access to the exact proximal-point or HOME value. In particular, we study a parameter-free Hölderian inexact gradient method and an inexact descent method with Armijo line search, both exploiting the weak smoothness of HOME. We establish subsequential convergence under mild inexactness assumptions, and global and linear convergence under the Kurdyka--Łojasiewicz (KL) property. Preliminary experiments on ridge-regularized hinge-loss classification, a high-dimensional MCP-regularized classification model, and robust matrix completion illustrate the numerical behavior of the proposed methods and the role of the HOME order.

math.OC↗

On the pro-Kummer étale cohomology of $\mathbb B_{\operatorname{dR}}$

We investigate $p$-adic cohomologies of log rigid analytic varieties over a $p$-adic field. For a log rigid analytic variety $X$ defined over a discretely valued field, we compute the Kummer pro-étale cohomology of $\mathbb{B}_{\mathrm{dR}}^+$ and $\mathbb{B}_{\mathrm{dR}}$. When $X$ is defined over $\mathbb{C}_p$, we introduce a logarithmic ${B}_{\mathrm{dR}}^+$-cohomology theory, serving as a deformation of log de Rham cohomology. Additionally, we establish the log de Rham-étale comparison in this setting and prove the degeneration of both the Hodge-Tate and Hodge-log de Rham spectral sequences when $X$ is proper and log smooth.

math.NT↗

A declarative approach to specifying Paxos using three-valued modal fixpoint logic

We present Three-valued Fixpoint Quorum Logic, or 3muQL for short; a three-valued modal fixed-point logic designed for declaratively specifying and reasoning about distributed algorithms, such as the Paxos consensus algorithm. Our methodology represents a distributed algorithm as a logical theory, enabling correctness properties to be derived directly within the framework -- or revealing logical errors in the algorithm's design when they exist. 3muQL adopts a declarative approach, specifying the overall logic of computation without prescribing control flow. Notably, message-passing and state-transitions are not explicitly modelled, and notions of 'quorum' are abstracted from concrete thresholds to abstract modal operators. This distinguishes our framework from approaches like TLA+. The logical abstraction emphasises the essence of distributed algorithms, offering a novel perspective on their specification and reasoning. We define the syntax and semantics of 3muQL, explore its theoretical properties, and demonstrate its applicability through a detailed treatment of the Paxos consensus algorithm. By presenting Paxos as a logical theory and deriving its standard correctness properties, we showcase the framework's capacity to handle non-trivial distributed systems. We envision 3muQL as a versatile tool for specifying and reasoning about distributed algorithms. The Paxos example highlights the framework's ability to capture intricate details, offering a new lens through which distributed algorithms can be specified, studied, and checked. The ideas we present are easily implemented, and to demonstrate this we have implemented a freely-available proof-of- concept 3muQL model-checker, as an effective prototyping tool.

cs.LO↗

Vacuum Polarization, Geodesic Equation and Sachs-Wolfe Effect

We show that the null geodesic equation for photons is modified in the presence of a charged scalar field, with quantum fluctuations acting as an effective mass term that changes the null paths to timelike curves. This effect can be interpreted as a vacuum polarization phenomenon in curved spacetime. The resulting contribution to the Sachs-Wolfe effect varies with photon frequency, leading to frequency-dependent corrections to the cosmic microwave background (CMB) blackbody spectrum in the form of a $μ$-distortion, as well as modifications to the CMB power spectrum. We estimate these within a standard inflationary scenario and find that while the correction to the CMB power spectrum is significant when the scalar field is light, the magnitude of the $μ$-distortion depends strongly on the regularization prescription.

astro-ph.CO↗

The Fenchel-Young Generalization of Bayesian Principles

Conjugate Bayes plays a key role in machine learning, ensuring computationally simple posterior updates. We generalize the variational principle behind this computation by using the Fenchel-Young (FY) inequality, which lets us define a generalized evidence lower bound beyond the KL geometry, and at equality, characterizes new generalized posteriors. A generalized notion of conjugacy follows, defined as closure of prior-potential families that are affine under translation by the loss. We show that such families not only preserve additive canonical updating, but also posterior inference with parameter-dependent supports and tuneably heavy tails. This combination is not feasible with standard conjugate Bayes. We derive a new FY generalization of expectation maximization (EM), which recovers classical and Hard EM, and amortized versions. We show examples, including generalized Bayesian linear regression with closed-form bounded support and heavy-tailed posteriors, and a Gaussian mixture with sparse cluster assignments.

cs.LG↗

Fragility-aware Classification for Risk Characterization and Robust Learning

Classification models play a central role in data-driven decision-making applications such as medical diagnosis, recommendation systems, and risk assessment. Traditional performance metrics, such as accuracy and AUC, quantify classification errors and pairwise ranking performance but do not account for the magnitude of errors, i.e., the risk of confident misjudgments. This limitation is particularly consequential in safety-critical and cost-sensitive settings, where overconfident errors can lead to severe outcomes. To address this issue, we propose the Fragility Index (FI), a novel performance metric that evaluates classifiers from a risk-averse perspective by capturing the tail risk of confident misjudgments. We formulate FI within a robust satisficing (RS) framework to quantify classifier sensitivity under distributional uncertainty. Building on this, we develop a tractable surrogate-based training framework and establish provable bounds connecting training fragility to ranking-error FI. We further derive tractable reformulations for a broad class of loss functions, including cross-entropy, hinge-type, and Lipschitz losses, and identify specific conditions under which these reformulations are exact. We also introduce an FI-induced regularizer for deep neural networks. Empirical results on real-world medical diagnosis tasks demonstrate that FI complements existing metrics by revealing error tail risk not reflected in accuracy or AUC. FI-based models achieve competitive predictive performance while generally attaining lower FI. In the simulated human--AI diagnostic workflow, they also achieve lower average operational costs than empirical risk minimization.

cs.LG↗

Strategic timing of arrivals to a queueing system with scheduled customers

This paper examines a single-server queueing system that serves both scheduled and strategic walk-in customers. The service discipline follows a first-come, first-served policy, with scheduled customers granted non-preemptive priority. Each walk-in customer strategically chooses their arrival time to minimise their expected waiting time, taking into account the reservation schedule and the decisions of other walk-in customers. We derive the Nash equilibrium arrival distribution for walk-in customers. We also study the case where early arrivals are allowed and analyse its impact on equilibrium arrival patterns. By analysing various appointment schedules, we assess their effects on equilibrium arrival behaviour, waiting times, and server idle time. Finally, we compare different scheduling policies and evaluate their impact on overall system performance.

math.PR↗

Multi-View Causal Discovery without Non-Gaussianity: Identifiability and Algorithms

Causal discovery is a difficult problem that typically relies on strong assumptions on the data-generating model, such as non-Gaussianity. In practice, many modern applications provide multiple related views of the same system, which has rarely been considered for causal discovery. Here, we leverage this multi-view structure to achieve causal discovery with weak assumptions. We propose a multi-view linear Structural Equation Model (SEM) that extends the well-known framework of non-Gaussian disturbances by alternatively leveraging correlation over views. We prove the identifiability of the model for acyclic SEMs. Subsequently, we propose several multi-view causal discovery algorithms, inspired by single-view algorithms (DirectLiNGAM, PairwiseLiNGAM, and ICA-LiNGAM). The new methods are validated through simulations and applications on neuroimaging data, where they enable the estimation of causal graphs between brain regions.

cs.LG↗

ACTIVA: Amortized Causal Effect Estimation via Variational Autoencoders

Predicting post-intervention distributions from observational data is central to many scientific and decision-making problems, but remains challenging due to causal ambiguity, restrictive modeling assumptions, and the lack of amortization across tasks. We introduce ACTIVA, a transformer-based conditional variational autoencoder for amortized estimation of full interventional distributions from observational data and intervention queries. ACTIVA learns a conditional latent prior that amortizes causal knowledge across diverse training tasks, so that a new causal model drawn from the training distribution is handled in a single forward pass, without interventional data, a causal graph, or per-task fitting. Beyond the training distribution, only a parametric shift of the simulator is tested. We provide a population-level characterization of ACTIVA's estimand, showing that, under idealized expressivity and infinite samples assumptions, ACTIVA's learning objective targets a simulator-weighted mixture over the interventional distributions of causal models that are observationally compatible with the input. Empirically, on synthetic datasets and biologically realistic gene-expression simulations, ACTIVA substantially outperforms a correlational baseline, reduces spurious non-descendant effects, and achieves competitive performance relative to strong amortized baselines. On a pair of observationally equivalent models sharing a single observational dataset, ACTIVA recovers the predicted mixture, validating the theory in a finite-capacity model. Our results show that ACTIVA is a promising approach for estimating interventional distributions from observational data.

cs.LG↗

The Mathematical Theory of Double Descent as Shrinkage, not Overfitting: Matching Bounds for Path-Regularized Multilayer Neural Networks

We give a nonasymptotic generalization theory for multilayer fully connected neural networks trained with path regularization, for general Lipschitz losses and without assuming the loss bounded, the architecture sparse, or any width or depth limit. Approximation error is modelled explicitly, and along the way we settle an open problem of E et al. on approximation rates in generalized Barron spaces. We treat the underparameterized and overparameterized regimes separately, which is what allows the resulting curve to be non-monotone in the width. We then prove lower bounds on the error itself, valid at every target and at every local minimizer, and combine them with the upper bounds into a theorem asserting that the error - not merely our bound on it - descends, rises and descends again as the width grows, with a peak exceeding the final plateau by a factor diverging in the sample size. Having both sides of the bound also identifies what drives the ascent, and it is not overfitting: once the regularization exceeds the dual norm of the noise, which the prescribed schedule does at every width, a slow-rate oracle inequality controls the error with no variance term at all. The rise is instead the shrinkage demanded by the regularization that the underparameterized regime requires, and we show it cannot be removed by any width-independent regularization under which the theory's guarantees hold. This mechanism is a property of the estimator analyzed here; we do not claim it accounts for the double descent reported for unregularized training.

cs.LG↗

Macroscopic quantum coherence and entanglement in mechanical systems

The notion of a macroscopic quantum state must be pinned down in order to assess how well experiments probe the large-scale limits of quantum mechanics. However, the issue of quantifying so-called quantum macroscopicity is fraught with multiple approaches having varying interpretations and levels of computability and measurability. Here, we introduce two measures that capture independent macroscopic properties: i) extensive size, measuring the degree of coherence in position or momentum observables relative to atomic-scale units, and ii) entangled size, quantifying the number of entangled subsystems. These measures unify many desirable features of past proposals while having rigorously justified interpretations from quantum information theory in terms of coherence and multipartite entanglement. We demonstrate how to estimate them and obtain lower-bounds using experimental data from micro-mechanical oscillators and diffracting molecules. Notably, we find evidence for genuine multipartite entanglement of $10^5$ to $10^7$ atoms in recent mechanical superposition states.

quant-ph↗

MouseGPT: A Large-scale Vision-Language Model for Mouse Behavior Analysis

Analyzing animal behavior is crucial in neuroscience, yet deciphering its intricate dynamics remains challenging. Traditional machine vision approaches detect spontaneous behaviors but are constrained by limited interpretability and reliance on manual labeling, restricting exploration of the full behavioral spectrum. Here, we introduce MouseGPT, an integrated vision-language model and analytical framework that translates raw video of animal activity into natural language to automate open-vocabulary behavior analysis. Built upon a comprehensive dataset of over 42 million frames spanning diverse psychiatric conditions, MouseGPT maps multi-view or single-camera recordings directly into computable semantic representations. An agentic framework leverages these representations for detailed behavior profiling, cross-view stable clustering, and zero-shot novel behavior discovery without requiring labor-intensive annotation. Surpassing conventional kinematics-based pipelines and generalist vision-language models in behavioral precision and adaptability, MouseGPT establishes continuous semantic representations as a powerful tool for deciphering complex ethological dynamics in animal models.

cs.CV↗

Approximating Kemeny's constant via spectral sparsification

Kemeny's constant of a network quantifies the expected time for a random walk to reach a target vertex chosen according to the stationary distribution, independently of the starting vertex. The purpose of this work is twofold. First, we introduce the class of slightly regular networks, whose orthogonal degree vector is an eigenvector of the Laplacian, and derive an exact expression for Kemeny's constant for this class, extending previous results beyond regular networks. Second, we address the efficient approximation of Kemeny's constant using spectral sparsification. We establish multiplicative bounds relating Kemeny's constant of a network to that of any of its spectral sparsifiers, and use these bounds to design an approximation algorithm. While standard exact approaches based on a full spectral decomposition or on the computation of a pseudoinverse have $O(n^3)$ complexity, our method has complexity $O(n^2\log^{1+o(1)}n)$ for fixed approximation parameters, and is therefore nearly quadratic in the number of vertices even for dense networks.

math.CO↗

On conservative algebras of 2-dimensional Algebras

In 1990 Kantor introduced the conservative algebra $\mathcal{W}(n)$ of all algebras (i.e. bilinear maps) on the $n$-dimensional vector space. In case $n >1$ the algebra $\mathcal{W}(n)$ does not belong to well known classes of algebras (such as associative, Lie, Jordan, Leibniz algebras). We describe $\frac{1}{2}$derivations, local (resp. $2$-local) $\frac{1}{2}$-derivations and biderivations of $\mathcal{W}(2)$. We also study similar problems for the algebra $\mathcal{W}_2$ of all commutative algebras on the two-dimensional vector space and the algebra $\mathcal{S}_2$ of all commutative algebras with trace zero multiplication on the two-dimensional space.

math.RA↗

Reducing QPU Calls in Variational Quantum Algorithms via Classical Offloading of Gradient Computation

Variational quantum algorithms (VQAs) are a promising approach for leveraging near-term quantum computers, but trainability and quantum-resource costs remain major challenges. Here we address these challenges with the \textbf{H}ardware \textbf{E}fficient and dynamical \textbf{LI}e algebra supported \textbf{A}nsatz (HELIA) and two training methods combining the classical-enhanced \g method with the quantum-based Parameter-Shift Rule (PSR). This distributes gradient estimation and training across classical and quantum hardware. We evaluate ground-state estimation of 6- to 18-qubit Hamiltonians using the Variational Quantum Eigensolver (VQE) and quantum phase classification for Hamiltonians up to 12 qubits. For VQE, our methods improve accuracy and success rates, with a mean reduction in estimated logical quantum evaluations of up to $60\%$ relative to Full-PSR training of the same ansatz. For classification, the largest improvement in mean peak test accuracy relative to Full-PSR is $2.8$ percentage points. We also use these methods as a warm-start pretraining strategy for Hamiltonians with exponential-dimensional dynamical Lie algebras. Gradient diagnostics for the studied Hamiltonian configurations show slower gradient-variance decay than the selected deep hardware-efficient reference over the simulated system sizes, potentially paving the way for training large-qubit quantum models.

quant-ph↗