\log q_t(i
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Empirical Characterization of Inference-Time Elicited Probability Transformations in Large Language Models
Announce Type: replace Abstract: Large language models increasingly rely on inference-time procedures such as chain-of-thought reasoning, self-refinement, retrieval augmentation, and verifier-guided revision, yet the structure of elicited probability transformations under these procedures remains poorly understood. We study externally elicited probability assignments over candidate answers and observe recurring approximate log-ratio relationships: \[ \log \tilde q_t(i) = \alpha_t \left( \log...
Hyperstatistics
arXiv:2604.24783v2 Announce Type: replace-cross Abstract: We propose a general approach, named by us hyperstatistics, to treat complex systems, in which Boltzmann-Gibbs statistics breaks down in domains of the system. Hyperstatistics preserves the concavity of nonadditive $q$-entropy. We obtain analytical closed-form expressions for the here proposed $q$-generalized Boltzmann factor $B_q$ considering uniform, $\gamma$, Log-normal, F, and the $q$-$\gamma$ probability distribution functions.
A geometric $q$-analogue of Hamiltonian Monte Carlo
arXiv:2512.13246v3 Announce Type: replace Abstract: Hamiltonian Monte Carlo (HMC) generates efficient Markov transitions by combining Hamiltonian dynamics with a Metropolis correction. This paper develops a geometric \(q\)-analogue of HMC by replacing classical Hamiltonian dynamics with a \(q\)-deformed Hamiltonian system arising from \(q\)-calculus. Starting from a Lagrangian formulation, we derive the corresponding \(q\)-Hamiltonian equations and prove the formal invariance of the...
Spectral Anatomy of Quantum Gaussian Process Kernels
Announce Type: replace Abstract: Two recent results have reshaped quantum Gaussian processes (QGPs). On the one hand, \citet{lowe2025assessing} rule out the exponential speedups claimed by HHL-based QGP regression in the typical, well-conditioned regime; on the other, an independent line of work shows that highly expressive quantum kernels suffer posterior pathologies that break Bayesian optimization. We show that these seemingly unrelated phenomena are governed by the same quantity: the...
Spectral Anatomy of Quantum Gaussian Process Kernels
Announce Type: new Abstract: Two recent results have reshaped quantum Gaussian processes (QGPs). On the one hand, \citet{lowe2025assessing} rule out the exponential speedups claimed by HHL-based QGP regression in the typical, well-conditioned regime; on the other, an independent line of work shows that highly expressive quantum kernels suffer posterior pathologies that break Bayesian optimization.
A Perturbed q-Tsallis Self-Concordant Barrier for Spectrally Robust Semidefinite Programming
Announce Type: cross Abstract: We introduce and analyse a perturbed $q$-Tsallis barrier for semidefinite programming (SDP), defined as a spectral perturbation of the classical log-det barrier on the cone of positive definite matrices. The barrier introduces eigenvalue-adaptive stiffening through a Tsallis-type matrix-power term controlled by parameters $q>1$ and $\eta\geq0$. Our main theoretical contribution is a sharp characterisation of the differential self-concordance regime of the...
Revisiting $O(n \log \log n)$ chaining for anchored edit distance
arXiv:2606.03929v1 Announce Type: new Abstract: Colinear chaining is a classical heuristic for sequence alignment: it enables scalable genome comparison and is a main component of many state-of-the-art read mappers based on seed-chain-extend. The earliest $O(n \log \log n)$ time algorithms by Eppstein et al. (J. ACM, 1992) chained $n$ fragments between two sequences $T$ and $Q$ while minimizing a gap cost based on the diagonal distance $\Delta_{\text{diag}}$ between consecutive fragments.
Generalized Guarantees for Variational Inference in the Presence of Even and Elliptical Symmetry
arXiv:2511.01064v3 Announce Type: replace-cross Abstract: Variational inference (VI) approximates a target density $p$ by the best match $q$ in a family of tractable distributions. The best variational approximation is found by minimizing a divergence between distributions, $D(p||q)$, and several divergences have been proposed as objective functions for VI, with different choices leading to different approximations. We show that even when these divergences have different minimizers, the...
On the Duke--Erd\H{o}s--R\"odl Problem at the One-Third Threshold
Announce Type: cross Abstract: Let $G$ be an $n$-vertex graph with $e(G)\ge n^2/ k$. We prove a self-contained internal short-cycle core theorem at the threshold $k\le n^{1/3}$: the graph $G$ contains a subgraph $H_6$ with $\Omega(n^2/ k^3)$ edges in which every two distinct edges lie together on a cycle of length at most $6$ contained in $H_6$, and a subgraph $H_8$ with $\Omega(n^2/k^2)$ edges in which every two distinct edges lie together on a cycle of length at most $8$ contained in...
A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation
arXiv:2504.18352v2 Announce Type: replace Abstract: Given two convex polygons $P$ and $Q$ with $n$ and $m$ edges, the maximum overlap problem is to find a translation of $P$ that maximizes the area of its intersection with $Q$. We give the first randomized algorithm for this problem with linear running time. Our result improves the previous two-and-a-half-decades-old algorithm by de Berg, Cheong, Devillers, van Kreveld, and Teillaud (1998), which ran in $O((n+m)\log(n+m))$ time, as well as...