Site uses cookies to provide basic functionality.
Javascript rendering is set to off by default when visiting the site via .onion and .i2p domains. It can be enabled back again in user's settings section. Javascript rendering set to off means, that you can disable javascript in your browser now and the site will remain functional.
There is also IRC server now available via native IRC clients or non javascript web based one.
Fonts can be adjusted in user's settings section as well.
Check FAQ for more.

OK

Networks
Languages
1 2 3 5 8 11 17 25 37 54 79 116 170 249 334 335 336 337 338 365 532 534 783 895 1144 1146 1313 1429 1508 1562 1599 1624 1641 1653 1661 1667 1670 1673 1675 1676 1677 1678 ▲ ▼
arXiv:2606.00725v1 Announce Type: cross Abstract: Using the concepts of Eulerian-spanning set and coboundary operator, we generalize Hadlock's conversion of the maxcut problem on planar graphs to one on general graphs with non-negative weights. Using our conversion, we can explore algorithms for maxcut beyond the class of planar graphs. We obtain a Fixed-Parameter Tractable algorithm for $k$-contraction apex graphs. Specifically, our algor..
arXiv:2606.00737v1 Announce Type: cross Abstract: This paper investigates the optimization mechanisms of non-convex Model Predictive Control (MPC) using the Maximum Entropy Differential Dynamic Programming (ME-DDP) framework. Navigating non-convex cost landscapes induced by nonlinear dynamics, multiple obstacles, etc. remains a fundamental challenge in robotics, where gradient-based methods frequently converge to suboptimal local minima. W....
arXiv:2606.00749v1 Announce Type: cross Abstract: We combine Reimann's spectral typicality theorem -- a modern formulation of quantum ergodicity -- with the framework of Interval Quantum Mechanics (IQM). In IQM, quantum states are represented not by points but by \emph{quantum parcels}: weak open convex sets of density matrices defined by finitely many expectation intervals. Such parcels are the exact mathematical representation of the epi....
arXiv:2606.00783v1 Announce Type: cross Abstract: Reliable quantification of malaria dynamics in sub-Saharan Africa is hindered by short, noisy, and spatially heterogeneous surveillance records. In Ghana, health-facility data from 2014 to 2023 reveal non-linear and age-specific fluctuations in hospital admissions, yet existing approaches struggle to capture stochastic variability or provide credible uncertainty bounds. This study develops ....
arXiv:2606.00834v1 Announce Type: cross Abstract: Accurate malaria forecasting remains a major challenge in sub-Saharan Africa, where strong seasonality, reporting uncertainty, and non-stationary transmission dynamics reduce the reliability of conventional models. In Ghana, district-level malaria surveillance requires forecasting frameworks that are probabilistically rigorous and robust under limited data. This study proposes a hybrid fram....
arXiv:2606.00858v1 Announce Type: cross Abstract: This article is concerned with change point detection for object-valued data that reside in a metric space, which has attracted some recent interests in statistics and econometrics literature. The existing methods either focus on independent data or can only detect change in the Fr\'echet mean or variance. In this paper, we propose a self-normalization (SN, hereafter) based statistic for de....
arXiv:2606.00864v1 Announce Type: cross Abstract: The bandwidth-free tests/inferences for a multi-dimensional parameter have attracted considerable attention in econometrics and statistics literature. These tests can be conveniently implemented due to their tuning-parameter free nature and possess more accurate size as compared to the traditional HAC-based approaches, where consistent long run variance estimation was involved. However, whe....
arXiv:2606.00887v1 Announce Type: cross Abstract: Testing simple or composite hypothesis on a functional parameter has attracted considerable attention in time series analysis. To accommodate for the unknown temporal dependence, classical nonparametric approaches such as block bootstrapping and subsampling all involve a bandwidth parameter, the choice of which can substantially affect the finite sample performance. The self normalization (....
arXiv:2606.00937v1 Announce Type: cross Abstract: Neural operators provide fast surrogate models for PDE simulations, but standard architectures often treat geometry and discretization as secondary to field data. Physical states are usually represented as grid-channel stacks, even when different quantities naturally belong on vertices, edges, faces, cells, boundaries, or interfaces and must satisfy compatibility constraints. We propose Cel....
arXiv:2606.01002v1 Announce Type: cross Abstract: Engression is a recently proposed and effective framework for conditional distribution learning. Its multi-step Reverse Markov extension further improves generative flexibility by decomposing complex conditional sampling into sequential reverse transitions. Despite their strong empirical performance, rigorous finite-sample statistical guarantees for these methods remain unavailable. In this..
arXiv:2606.01029v1 Announce Type: cross Abstract: A spin-orbit Hamiltonian with an effective gauge structure carries two distinct loop objects that are routinely conflated: an energy-independent Wilson holonomy, which organizes interference and internal spin transport, and an energy-dependent monodromy, which quantizes the spectrum. We show that cleanly separating these objects supplies a precise, computable bridge between the loop/holonom....
arXiv:2606.01107v1 Announce Type: cross Abstract: We study fitting problems, sometimes called ``training problems'', where we have a finite sample consisting of inputs and outputs, and we want to know whether there is a function in a certain class that could produce these outputs, exactly or approximately, on the given inputs. We focus on the computational and descriptive complexity of fitting for logically-defined classes in common decida..
arXiv:2606.01129v1 Announce Type: cross Abstract: The Laplace-Beltrami formalism, in which the Ricci tensor in the Einstein field equations (EFEs) is formulated at leading-order in terms of the partial-differential Laplace-Beltrami operator, was previously applied to coalescing compact binaries (CCBs) generating gravitational waves (GWs). Supposing that the CCB is an effective singular body -- a hollow mass-shell -- that follows a Kerr met....
arXiv:2606.01216v1 Announce Type: cross Abstract: The elementwise Hadamard product of two low-rank matrices provides a parameter-efficient model for data with multiplicative structure, but its modeling is challenging due to the presence of additional symmetries under coupled row/column scalings between the two factors. In order to leverage the geometry of the space, we formulate the learning of such matrices as optimization on a Riemannian..
arXiv:2606.01244v1 Announce Type: cross Abstract: We study operator learning using encoder--decoder neural networks. Inspired by the function-space theory of neural networks, we introduce a variation space as an infinite-dimensional structural class for nonlinear operators. This space is defined through vector-valued measures directly on the input and output spaces. For operators in this space, we establish approximation bounds for encoder....
arXiv:2606.01354v1 Announce Type: cross Abstract: We consider integrable hierarchies such as KP, modified KP, 2D Toda lattice, BKP (small and large), DKP, Pfaff-Toda and their multi-component generalizations. We work in the framework of the bilinear formalism in which the universal dependent variable is a tau-function satisfying bilinear equations of the Hirota-Miwa type. Our principal interest in this paper is the dispersionless versions ....
arXiv:2606.01412v1 Announce Type: cross Abstract: Post-training quantization is widely used for compressing large neural networks, but aggressive low-bit quantization can significantly degrade model quality. A common remedy is to augment the quantized weights with a low-rank correction, leading to approximations of the form $W\approx Q+LR$. In this paper, we study this low-precision plus low-rank representation through the layer-wise recon....
arXiv:2606.01444v1 Announce Type: cross Abstract: Scientific discovery is not only answer generation but revision of the representational regime in which evidence, artifacts, operations, and verifiers are typed. We develop a category-theoretic account of agentic discovery for materials science. In a fixed regime b with schema category S_b, the system state is a copresheaf I_t: S_b -> Set, and provenance is the category of elements \int_{S_....
arXiv:2606.01602v1 Announce Type: cross Abstract: Pairwise dependence measures such as correlation and causality are fundamental to temporal data mining, yet there is still no principled and robust way to quantify dependence between heterogeneous data types, especially between continuous time series and discrete temporal event sequences. Existing approaches rely on ad hoc transformations or mutual-information estimators that are highly sen....
arXiv:2606.01713v1 Announce Type: cross Abstract: We propose FlipItRight, a framework for stable planar pose-targeted throw-flip with a high-DoF manipulator. The task is decomposed into an object-level planner, which generates candidate release states satisfying the desired landing pose, and a robot-level planner, which evaluates executability and constructs a feasible swing motion. Treating the release state as an explicit intermediate re....
arXiv:2606.01733v1 Announce Type: cross Abstract: Preconditioning is a fundamental technique for accelerating classical linear system solvers, and understanding when its benefits persist in quantum linear system (QLS) solvers is important for assessing the practical resource requirements of quantum linear algebra. In QLS algorithms, however, the potential advantage of preconditioning may be offset by the normalization overhead incurred by ....
arXiv:2606.01787v1 Announce Type: cross Abstract: A new class of asynchronous adaptive first-order optimization methods is introduced, comprising asynchronous variants of several popular algorithms. Versions of these methods using momentum and/or inexact normalization are also considered. The convergence of methods in the class on non-convex functions is analyzed in a fully stochastic setting, and is shown to be (up to logarithmic factors)..
arXiv:2606.01863v1 Announce Type: cross Abstract: Continual learning struggles to balance retaining past knowledge with absorbing new tasks. Stefan-CL elegantly resolves this stability-plasticity dilemma through the physics of melting. It frames consolidated knowledge as a protected "solid" and unused capacity as an adaptable "liquid." As the network learns, this boundary expands, governed by a "latent heat" tuning dial. By mathematically ..
arXiv:2606.01877v1 Announce Type: cross Abstract: We found sets of exact analytic quasi-stationary states of a massive scalar field in a dyonic Kerr-Sen black hole~(DKSBH) background in the maximally extended spacetime region. A central novelty is the use of horizon-regular ingoing Eddington-Finkelstein coordinates, which enables a direct and unambiguous imposition of the ingoing boundary condition at the horizon. The exact radial solution....
arXiv:2606.01943v1 Announce Type: cross Abstract: Absolutely maximally entangled (AME) states and, more generally, $k$-uniform states in $(\C^q)^{\otimes n}$ are central objects in multipartite entanglement theory, with applications to quantum secret sharing, quantum masking, and quantum error correction. In the extremal case $k=\lfloor n/2\rfloor$, Scott (2004) proved a sharp nonexistence bound showing that AME states cannot exist once th....
arXiv:2606.01960v1 Announce Type: cross Abstract: We consider the problem of detecting a Return to Baseline (RtB) in high-frequency monitoring data preceding and following an intervention, where the aim is to identify the time at which the data-generating distribution realigns with its pre-intervention distribution. We propose a sequential, distribution-free testing procedure that does not rely on specifying a null model and provides anyti....
arXiv:2606.01963v1 Announce Type: cross Abstract: We study local pure coordination games on finite social networks, continuing the framework of Hutchcroft, Rospuskova, and Tamuz. They showed that low inefficiency in local coordination forces the underlying graph to be amenable, with a square-root loss in the amenability parameter. We improve this loss in the binary unbiased setting. Using Shapley values of a mutual-information game associa..
arXiv:2606.01965v1 Announce Type: cross Abstract: The separation of multicomponent signals with crossing instantaneous frequency (IF) curves remains a fundamental challenge in time-frequency analysis. Although the synchrosqueezed wavelet-chirplet transform (SWCT) enhances time-frequency readability by introducing a chirprate variable, its effectiveness is constrained by the underlying assumption of local linear chirp. Consequently, this me....
arXiv:2606.01979v1 Announce Type: cross Abstract: We provide a brief primer for the idea behind formalising hierarchical causality in the context of complex systems. Here actors are not simply agents. Actors instantiate causation classes. Agents implement local dynamics in given levels or organisation in a given system. Hierarchical causality then describes how actor-level roles constrain, select, and organise agent-level behaviour across ..
arXiv:2606.01990v1 Announce Type: cross Abstract: The Admixture Model describes genetic marker data by representing each individual's genome as a mixture of contributions from $K$ ancestral populations, with the individual admixture vector summarizing the corresponding ancestry proportions. In population and forensic genetics, a key question is whether an individual's genome supports a predominantly single-ancestry interpretation or whethe....
arXiv:2606.02047v1 Announce Type: cross Abstract: We introduce Convex Distance Operator Transport (CDOT), the first convex optimal transport framework that aligns distributions across heterogeneous domains by jointly preserving feature correspondence and intrinsic geometric structure. Specifically, CDOT employs an operator-based regularization that aligns aggregated distance structures by introducing distance and conditional expectation op....
arXiv:2606.02051v1 Announce Type: cross Abstract: We derive a fully 3-dimensional Summation-By-Parts scheme for a class of linear wave equations on hyperboloidal slices that meet future null infinity on a Minkowski background. The scheme is derived in spherical polar coordinates, with a major strength being that it is provably stable and allows having grid points at the origin and on the $z$-axis, despite coordinate singularities, and at i....
arXiv:2606.02065v1 Announce Type: cross Abstract: While it is well-known how to compute the cells of a Laguerre tessellation for a given set of weighted generator points, it is not obvious how to invert a Laguerre tessellation. That is, given that one observes a Laguerre tessellation, how can one retrieve the weighted generators corresponding to the observed cells. In this paper, we consider inversion of a class of random Laguerre tessella....
arXiv:2606.02223v1 Announce Type: cross Abstract: Estimating the generative mechanism of large-scale networks is a fundamental challenge in statistical machine learning. It requires the identification of the latent connectivity structure, which is in general an NP-hard combinatorial problem due to the absence of canonical node labels. We address this challenge by allowing for probabilistic couplings, thereby relaxing the assignment problem....
arXiv:2606.02263v1 Announce Type: cross Abstract: We study exact uniform sampling of permutations of length $n$ whose longest increasing subsequence (LIS) has prescribed length $k$. For $k \in \Theta(n)$, we give a direct rejection sampler whose expected running time is $O(n\log\log n)$ in the word-RAM model. The sampler uses an expanded proposal space consisting of permutations together with a specified increasing subsequence, and accepts....
arXiv:2606.02290v1 Announce Type: cross Abstract: We investigate a three-dimensional ghostly Hamiltonian realisation of the fully degenerate resonant sixth-order Pais-Uhlenbeck oscillator. On the classical level, the phase-space flow is non-diagonalisable and decomposes into two complex-conjugate Jordan chains of length three, explaining the appearance of oscillatory solutions with secular terms. Upon quantisation, we construct intertwini....
arXiv:2606.02311v1 Announce Type: cross Abstract: In a recent paper the $\gamma$-Boost scheduling policy was shown to minimize the tail of the response time distribution in a light-tailed M/G/1-queue. This policy schedules jobs using a boosted arrival time, defined as the arrival time of a job minus its boost, where the boost of a job depends on its exact job size. The $\gamma$-Boost policy can also be used when only partial job size infor....
arXiv:2606.02315v1 Announce Type: cross Abstract: Reduced-order models (ROMs) are widely employed to describe complex system dynamics when simulations with full-order models (FOMs) are computationally prohibitive. This study presents POD-AS-PRS, a novel model-reduction framework based on the active subspaces (AS) technique, which performs dimensionality reduction in both the state and parameter spaces, enabling efficient and high-fidelity ....
arXiv:2606.02335v1 Announce Type: cross Abstract: The Neural Spectral Element Method (NSEM) evaluates each network only at fixed Legendre-Gauss-Lobatto quadrature nodes and replaces all derivative calls with precomputed spectral differentiation matrices. The resulting deterministic loss enables limited-memory BFGS (L-BFGS) to reach residuals of 10^-9 to 10^-10. A Kosloff-Tal-Ezer coordinate map resolves electrochemical boundary layers, whi....
arXiv:2606.02369v1 Announce Type: cross Abstract: Microwave linear analog computers (MiLACs) offer a transformative paradigm for future multiple-input multiple-output (MIMO) systems by shifting complex signal processing into the analog domain, thereby significantly reducing computational complexity, radio-frequency chains, and analog-digital converters, while speeding up computation. However, the practical deployment of MiLACs is severely ....
arXiv:2606.02381v1 Announce Type: cross Abstract: In this study, a generalized operator-based mathematical conflict framework is presented to explicitly represent structural discrepancies between raw data and contextual data. The proposed structure treats conflict as a local, directional, and context-sensitive quantity, integrating components such as weighting, scale behavior, and output mapping under a unified abstract operator. Without b..
arXiv:2606.02421v1 Announce Type: cross Abstract: Density cube theory extends the canonical quantum density matrix $\rho_{ij}$ with the addition of an extra index to $\rho_{ijk}$. The elements of the density cube with two different indices, $\rho_{iij}$ and $\rho_{ijj}$, correspond to the real and imaginary parts of the off-diagonal element $\rho_{ij}$ of the density matrix and describe double-path interference, while those with three diff..
arXiv:2606.02531v1 Announce Type: cross Abstract: Clifford codes are a natural generalization of quantum stabilizer codes based primarily on representation theory. This class of codes has previously been extended to the setting of quantum subsystem codes. We formulate a two-fold generalization of Clifford codes, for both the hybrid classical and quantum information and projective representation theory settings. This leads to new classes of..
arXiv:1703.02849v4 Announce Type: replace Abstract: In this paper, we develop motivic derived algebraic geometry, an enhancement of derived algebraic geometry adapted to the $\mathbb{A}^1$-homotopy theory of Morel and Voevodsky. We construct motivic model categories by imposing descent for a Grothendieck topology and invariance with respect to an interval object, and use them to formulate motivic versions of $\infty$-categories, $\infty$-t..
1 2 3 5 8 11 17 25 37 54 79 116 170 249 334 335 336 337 338 365 532 534 783 895 1144 1146 1313 1429 1508 1562 1599 1624 1641 1653 1661 1667 1670 1673 1675 1676 1677 1678 ▲ ▼
100 visitors online