Research
Research
Research
Research
204,504+ open-access research outputs.
Most familiar equilibrium concepts, such as Nash and correlated equilibrium, guarantee only that no single player can improve their utility by deviating unilaterally. They offer no guarantees against …
We classify fillable contact structures on all negative-definite star-shaped plumbings. Along the way, we show that such Seifert fibred spaces admit a unique negative maximal twisting number, and comp…
We adapt the Ozsv\'ath-Szab\'o full path algorithm to every star-shaped graph and establish a correspondence between negative-twisting tight contact structures on any Seifert fibred space over $S^2$, …
We present FlexiTac, a low-cost, open-source, and scalable piezoresistive tactile sensing solution designed for robotic end-effectors. FlexiTac is a practical "plug-in" module consisting of (i) thin, …
In realistic nanoscale transport set-ups, electron-phonon coupling leads to the exchange of heat between phonon baths and electronic reservoirs with finite heat capacities. Such exchange affects the f…
Efficient exploration is a central problem in reinforcement learning and is often formalized as maximizing the entropy of the state-action occupancy measure. While unconstrained maximum-entropy explor…
Autonomous agents act through sandboxed containers and microVMs whose state spans filesystems, processes, and runtime artifacts. Checkpoint and restore (C/R) of this state is needed for fault toleranc…
The standard post-training recipe for large multimodal models (LMMs) applies supervised fine-tuning (SFT) on curated demonstrations followed by reinforcement learning with verifiable rewards (RLVR). H…
Existing learning-based occupancy prediction methods rely on large-scale 3D annotations and generalize poorly across environments. We present FreeOcc, a training-free framework for open-vocabulary occ…
End-to-end (E2E) autonomous driving presents a promising approach for translating perceptual inputs directly into driving actions. However, prohibitive annotation costs and temporal data quality degra…
We propose new graph representations that exploit dense local structure to improve time and space simultaneously. Given an undirected graph $G$, we define a dual clique cover (DCC) representation of $…
To couple many independent modes from free space to on chip, the key challenge is not enhancing the many necessary coupling rates (scattering-matrix elements) between targeted mode pairs. Instead, the…
Range anxiety and long recharging times remain critical barriers to electric vehicle adoption. Dynamic Inductive Charging (DIC) offers a compelling solution by enabling wireless power transfer while d…
We study Tur\'an-type extremal problems for distance graphs, motivated by work of Csikv\'ari, Bollob\'as, Tyomkyn, and Uzzell. We determine the maximum number of vertex pairs at distance three in an $…
Large language models (LLMs) make reward design in reinforcement learning substantially more scalable, but generated rewards are not automatically reliable training objectives. Existing work has focus…
The black hole no-hair theorem is traditionally derived from the uniqueness theorems of general relativity. We show that a quantitative form follows from unitarity together with the standard semiclass…
We prove a transfer theorem for hereditary classes of $(r+1)$-uniform hypergraphs. Let $\mathcal G$ be such a class, and for $H\in\mathcal G$ write $\Delta(H)$ and $d(H)$ for the maximum degree and av…
Spectra are a prevalent yet highly information-dense form of scientific imagery, presenting substantial challenges to multimodal large language models (MLLMs) due to their unstructured and domain-spec…
For a graph \(G\), let $avm(G)$ denote the average size of its maximal matchings. This parameter was introduced by Engbers and Erey in the study of extremal problems for maximal matchings, and they as…
For three-dimensional (3D) magnetic objects with linear size $L$ exceeding a few exchange lengths, the micromagnetic state exhibits pronounced informational sparsity: low-dimensional, high-gradient re…
Free open-access publishing with Google Scholar indexing.
Submission Guide →