\emph{linear
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Closed-form linear moments of the two-dimensional angular central Gaussian distribution
arXiv:2605.31536v1 Announce Type: cross Abstract: The polar-angle marginal of a centred bivariate Gaussian distribution, obtained after integrating out the radial coordinate, gives the two-dimensional angular central Gaussian (ACG) distribution of Tyler. While its trigonometric and vector-valued moments have been studied in detail, to our knowledge there are no explicit closed-form expressions for the \emph{linear} moments $\mathbf{E}[\theta]$ and $\mathbf{E}[\theta^{2}]$ on the natural...
Memory by Design: Probabilistic Sequence Layers
arXiv:2605.31163v1 Announce Type: cross Abstract: We introduce the design-model framework: a way to derive efficient recurrent sequence maps from explicit assumptions about memory. A design model writes evidence into memory by exact Bayesian filtering; a query-dependent readout produces a predictive distribution whose mean is the layer output. In our linear-Gaussian instantiation, the \emph{Bayesian Layer} propagates both a mean and a covariance: the covariance tracks uncertainty over stored...
Mutual Information Optimization via K-Recursion and Automatic Differentiation for Linear Gaussian Wireless Networks
new Abstract: We present a differentiable framework for end-to-end mutual information (MI) optimization over linear Gaussian directed acyclic graphs (DAGs). The framework targets network-wide design under global constraints, such as a total transmit power budget, and covers MIMO precoding, amplify-and-forward relays, RIS-aided channels, and branching/merging topologies within a common linear Gaussian model. Its core ingredient is a \emph{K-recursion} that analytically propagates all...
Maximum Matching and Related Problems in Catalytic Logspace
arXiv:2604.24275v2 Announce Type: replace Abstract: Understanding the power of space-bounded computation with access to catalytic space has been an important theme in complexity theory over the recent years. One of the key algorithmic results in this area is that bipartite maximum matching can be computed in catalytic logspace with a polynomial-time bound, Agarwala and Mertz (2025). In this paper, we show that we can construct a \emph{maximum matching} in \emph{general graphs} in CL, and, in...
Regret Minimization with Adaptive Opponents in Repeated Games
arXiv:2606.06486v1 Announce Type: new Abstract: In this paper, we study regret minimization in repeated games with \emph{adaptive} opponents who can respond based on histories of play. The standard metric of \emph{external regret} in online learning is known to fail to capture such adaptivity. To account for players' counterfactual reasoning, we introduce {\tt Repeated Policy Regret (RP-Regret)}, a game-theoretic metric that measures the difference between the \emph{realized} and the...
Consecutive Support Matching Induced Parameter Tuning Accelerates Momentum Iterative Hard Thresholding
Announce Type: new Abstract: Momentum-based acceleration of iterative hard thresholding (IHT) can dramatically speed up sparse signal recovery from linear measurements, but its effectiveness hinges on careful parameter tuning -- a task complicated by the frequent support changes inherent to hard thresholding. We propose CosMIHT(Consecutive Support Matching Induced Momentum IHT), which resolves this difficulty through a simple adaptive rule: start with the conservative parameters and whenever...
On the instability of some upward propagating, exact, nonlinear mountain waves
Announce Type: replace Abstract: Using the short-wavelength instability method, we investigate the linear instability of an exact solution describing upward-propagating mountain waves, derived in A. Constantin, \emph{J. Phys. Theor.} (2023), under the assumption of a dry adiabatic flow. Within this approach, the stability problem reduces to analysing a system of ordinary differential equations along fluid trajectories.
Optimal Control and Dissipativity of Linear Hermitian Matrix-Valued Dynamical Systems
arXiv:2606.08856v1 Announce Type: cross Abstract: We develop a unified framework for linear-cost optimal control, finite-time optimal steering, dissipativity analysis, and zero-sum differential games for linear impulsive systems whose state is a Hermitian matrix evolving in $\mathbb{H}^{n+m}_{\succeq0}$, a class that encompasses continuous- and discrete-time linear systems and switched systems as degenerate cases, and includes the second-order moment dynamics of linear (stochastic) hybrid...
Scalable Constrained Multi-Agent Reinforcement Learning via State Augmentation and Consensus for Separable Dynamics
Announce Type: new Abstract: We present a distributed approach for constrained Multi-Agent Reinforcement Learning (MARL) that combines state-augmented policy learning with distributed consensus over dual variables. Our method targets systems where agents have separable dynamics but must coordinate to satisfy global resource constraints, a setting in which, as we demonstrate empirically, independent learning fails to produce feasible solutions because agents cannot determine appropriate...
Functional Attention: From Pairwise Affinities to Functional Correspondences
arXiv:2605.31559v1 Announce Type: new Abstract: Learning mappings between infinite-dimensional function spaces, or operator learning, is essential for many machine learning applications. Although transformer-based operators are popular, they often rely on token-wise attention. These methods treat continuous fields as discrete tokens and usually ignore the global functional structure.