Tootfinder

Skip a Layer or Loop it? Test-Time Depth Adaptation of Pretrained LLMs
Ziyue Li, Yang Li, Tianyi Zhou
https://arxiv.org/abs/2507.07996 https://arxiv.org/pdf/2507.07996 https://arxiv.org/html/2507.07996
arXiv:2507.07996v1 Announce Type: new
Abstract: Can a pretrained neural network adapt its architecture to different inputs without any finetuning? Do we need all layers for simple tasks, and are they adequate for challenging tasks? We found that the layers of a pretrained large language model (LLM) can be manipulated as separate modules to build a better and even shallower model customized for each test sample. In particular, each layer from the pretrained model can be skipped/pruned or repeated multiple times as recurrent neural networks (RNN), and stacked with others in arbitrary orders, yielding a chain-of-layers (CoLa) per sample. This compositional space greatly expands the scope of existing works on looped/recurrent pretrained modules, layer pruning, or early-exit networks. We develop a Monte Carlo Tree Search (MCTS) protocol to explore and identify the optimal CoLa for each sample from math and commonsense reasoning benchmarks. Compared to a static model of a fixed depth, CoLa allows shortcut paths (fast thinking), recurrence of the same layer(s) (slow thinking), and combining both, offering more flexible, dynamic architectures for different inputs. We conduct an extensive analysis of the MCTS-optimized CoLa, which leads to two key findings: (1) For >75% of samples with correct predictions by the original LLM, we can find shorter CoLa, suggesting a large space for improving inference efficiency; (2) For >60% of samples with originally incorrect predictions, we can identify CoLa achieving correct predictions, suggesting a large space of performance enhancement. Our results highlight the shortcomings of using a fixed architecture of pre-trained LLMs for inference on different samples and pave the way to unlock the generalization power of test-time depth adaptation.
toXiv_bot_toot

Back from a #cycling loop around the #ammersee !
Unfortunately I forgot to turn on my cycling computer for the first half hour 🥴 Yeah well, the red frame around the statistics page was quite clear but .. well.
Anyways! It was a nice ~50km loop with excellent weather (prepared with a lo…

High-Resolution Sustain Pedal Depth Estimation from Piano Audio Across Room Acoustics
Kun Fang, Hanwen Zhang, Ziyu Wang, Ichiro Fujinaga
https://arxiv.org/abs/2507.04230

High-Resolution Sustain Pedal Depth Estimation from Piano Audio Across Room Acoustics
Piano sustain pedal detection has previously been approached as a binary on/off classification task, limiting its application in real-world piano performance scenarios where pedal depth significantly influences musical expression. This paper presents a novel approach for high-resolution estimation that predicts continuous pedal depth values. We introduce a Transformer-based architecture that not only matches state-of-the-art performance on the traditional binary classification task but also ach…

The depth of the damage to the USA by the Republican party and this administration is catastrophic, especially in the long term.
Hundreds or thousands of incredibly damaging actions have been taken this year with seeming dozens more every week.
It is impossible to keep track of the destruction being done to the rule of law, our economy, human rights, our health...

Reasoning as a Resource: Optimizing Fast and Slow Thinking in Code Generation Models
Zongjie Li, Shuai Wang
https://arxiv.org/abs/2506.09396 https://

Reasoning as a Resource: Optimizing Fast and Slow Thinking in Code Generation Models
This position paper proposes a fundamental shift in designing code generation models: treating reasoning depth as a controllable resource. Rather than being an incidental byproduct of prompting, we argue that the trade-off between rapid, direct answers ("fast thinking") and elaborate, chain-of-thought deliberation ("slow thinking") must be explicitly managed. We contend that optimizing reasoning budgets across the entire model lifecycle - from synthetic data creation and benchmarking to real-wo…

NFL minicamp 2025 live updates: Browns rookie QBs look sharp https://www.espn.com/nfl/story/_/id/45460351/nfl-minicamp-live-updates-2025-news-notes-depth-charts

Tillis Suggests He Regrets Vote to Confirm Hegseth, Calling Him 'Out of His Depth' (Annie Karni/New York Times)
https://www.nytimes.com/2025/07/09/us/politics/tillis-hegseth-vote-unfit.html
http://www.memeorandum.com/250710/p1#a250710p1

Modelling intermediate internal waves with currents and variable bottom
Rossen Ivanov, Lyudmila Ivanova
https://arxiv.org/abs/2506.10123 https://

Modelling intermediate internal waves with currents and variable bottom
A model for internal interfacial waves between two layers of fluid in the presence of current and variable bottom is studied in the flat-surface approximation. Fluids are assumed to be incompressible and inviscid. Another assumption is that the upper layer is considerably deeper with a lower density than the lower layer. The fluid dynamics is presented in Hamiltonian form with appropriate Dirichlet-Neumann operators for the two fluid domains, and the depth-dependent current is taken into accoun…

AI-Driven SEEG Channel Ranking for Epileptogenic Zone Localization
Saeed Hashemi, Genchang Peng, Mehrdad Nourani, Omar Nofal, Jay Harvey
https://arxiv.org/abs/2506.09255

AI-Driven SEEG Channel Ranking for Epileptogenic Zone Localization
Stereo-electroencephalography (SEEG) is an invasive technique to implant depth electrodes and collect data for pre-surgery evaluation. Visual inspection of signals recorded from hundreds of channels is time consuming and inefficient. We propose a machine learning approach to rank the impactful channels by incorporating clinician's selection and computational finding. A classification model using XGBoost is trained to learn the discriminative features of each channel during ictal periods. Then, …

Generalist Models in Medical Image Segmentation: A Survey and Performance Comparison with Task-Specific Approaches
Andrea Moglia (Politecnico di Milano), Matteo Leccardi (Politecnico di Milano), Matteo Cavicchioli (Politecnico di Milano), Alice Maccarini (Universit\`a di Pavia), Marco Marcon (Politecnico di Milano), Luca Mainardi (Politecnico di Milano), Pietro Cerveri (Politecnico di Milano, Universit\`a di Pavia)

Generalist Models in Medical Image Segmentation: A Survey and Performance Comparison with Task-Specific Approaches
Following the successful paradigm shift of large language models, leveraging pre-training on a massive corpus of data and fine-tuning on different downstream tasks, generalist models have made their foray into computer vision. The introduction of Segment Anything Model (SAM) set a milestone on segmentation of natural images, inspiring the design of a multitude of architectures for medical image segmentation. In this survey we offer a comprehensive and in-depth investigation on generalist models…

HybridQC: Machine Learning-Augmented Quality Control for Single-Cell RNA-seq Data
Kaitao Lai
https://arxiv.org/abs/2507.08058 https://

HybridQC: Machine Learning-Augmented Quality Control for Single-Cell RNA-seq Data
HybridQC is an R package that streamlines quality control (QC) of single-cell RNA sequencing (scRNA-seq) data by combining traditional threshold-based filtering with machine learning-based outlier detection. It provides an efficient and adaptive framework to identify low-quality cells in noisy or shallow-depth datasets using techniques such as Isolation Forest, while remaining compatible with widely adopted formats such as Seurat objects. The package is lightweight, easy to install, and suita…

My least favorite work interactions are with customers’ 3rd party “rockstar” consultants. I never know how to respond to certain sorts of queries. Ones where I could answer the question as asked but it really implies a deeper misunderstanding. I feel like I want to write him a treatise on VPNs: what they are and how they work. And Cc his boss (who shares his surname…) to communicate the depth of the problem.
I’m letting my boss handle it. He’s the networking guy anyway…

Demystifying NCCL: An In-depth Analysis of GPU Communication Protocols and Algorithms
Zhiyi Hu, Siyuan Shen, Tommaso Bonato, Sylvain Jeaugey, Cedell Alexander, Eric Spada, Jeff Hammond, Torsten Hoefler
https://arxiv.org/abs/2507.04786

Demystifying NCCL: An In-depth Analysis of GPU Communication Protocols and Algorithms
The NVIDIA Collective Communication Library (NCCL) is a critical software layer enabling high-performance collectives on large-scale GPU clusters. Despite being open source with a documented API, its internal design remains largely opaque. The orchestration of communication channels, selection of protocols, and handling of memory movement across devices and nodes are not well understood, making it difficult to analyze performance or identify bottlenecks. This paper presents a comprehensive anal…

Low-depth quantum error correction via three-qubit gates in Rydberg atom arrays
Laura Pecorari, Sven Jandura, Guido Pupillo
https://arxiv.org/abs/2507.06096

Low-depth quantum error correction via three-qubit gates in Rydberg atom arrays
Quantum error correction (QEC) requires the execution of deep quantum circuits with large numbers of physical qubits to protect information against errors. Designing protocols that can reduce gate and space-time overheads of QEC is therefore crucial to enable more efficient QEC in near-term experiments. Multiqubit gates offer a natural path towards fast and low-depth stabilizer measurement circuits. However, they typically introduce high-weight correlated errors that can degrade the circuit-lev…

Dive into semantic reranking at Berlin Buzzwords 2025! Athanasios Papaoikonomou will explore how different models and reranking depths impact search performance, revealing important patterns and the real-world efficiency vs. effectiveness trade-off.
Learn more: https://

Exploring reranking depth in modern search pipelines
The use of semantic reranking on top of a ‘cheaper’ retrieval step becomes more and more common in modern search applications. It offers a different cost quality profile to semantic retrieval trading indexing time compute for retrieval time compute. The depth represents the number of documents that we select to retrieve and feed into the reranking model in order to optimise their ordering. Intuitively, there is a “natural” trade-off between the uplift we can achieve by operating on an i…

Extremal process of the local time of simple random walk on a regular tree
Yoshihiro Abe, Marek biskup
https://arxiv.org/abs/2506.09592 https://

Extremal process of the local time of simple random walk on a regular tree
We study a continuous-time simple random walk on a regular rooted tree of depth $n$ in two settings: either the walk is started from a leaf vertex and run until the tree root is first hit or it is started from the root and run until it has spent a prescribed amount of time there. In both cases we show that the extremal process associated with centered square-root local time on the leaves tends, as $n\to\infty$, to a decorated Poisson point process with a random intensity measure. While the inte…

We're recruiting on our MSc Sociology and Data Analytics for next September at the University of Limerick @…

This MSc offers in depth knowledge of sociological analysis, research… | Faculty of Arts, Humanities and Social Sciences, University of Limerick
This MSc offers in depth knowledge of sociological analysis, research methods and social science analytics - including high level training in data, data science, and data mining, and a range of sequenced topics that include crime, law, and deviance, culture and media, health and well-being, political analysis and social movements, and stratification and social inequality. The combination of high level training in research methods and robust exposure to core topics in Sociology and the Social …

Are Depth-2 Regular Expressions Hard to Intersect?
Rocco Ascone, Giulia Bernardini, Alessio Conte, Veronica Guerrini, Giulia Punzi
https://arxiv.org/abs/2507.03593

Are Depth-2 Regular Expressions Hard to Intersect?
We study the basic regular expression intersection testing problem, which asks to determine whether the intersection of the languages of two regular expressions is nonempty. A textbook solution to this problem is to construct the nondeterministic finite automaton that accepts the language of both expressions. This procedure results in a $Θ(mn)$ running time, where $m$ and $n$ are the sizes of the two expressions, respectively. Following the approach of Backurs and Indyk [FOCS'16] and Bringmann…

Estimating Object Physical Properties from RGB-D Vision and Depth Robot Sensors Using Deep Learning
Ricardo Cardoso, Plinio Moreno
https://arxiv.org/abs/2507.05029

Estimating Object Physical Properties from RGB-D Vision and Depth Robot Sensors Using Deep Learning
Inertial mass plays a crucial role in robotic applications such as object grasping, manipulation, and simulation, providing a strong prior for planning and control. Accurately estimating an object's mass before interaction can significantly enhance the performance of various robotic tasks. However, mass estimation using only vision sensors is a relatively underexplored area. This paper proposes a novel approach combining sparse point-cloud data from depth images with RGB images to estimate the …

In-depth analysis of violations of the (strong) equivalence principle in scalarized Einstein-Gauss-Bonnet theories
Mart\'in G. Richarte, J\'unior D. Toniato
https://arxiv.org/abs/2507.03983

In-depth analysis of violations of the (strong) equivalence principle in scalarized Einstein-Gauss-Bonnet theories
We conducted a theoretical analysis of the violation of the equivalence principle within a broad class of scalar-Einstein-Gauss-Bonnet theories that exhibit spontaneous scalarization. Beginning with the Jordan frame, we performed a conformal mapping to identify the equivalent model in the Einstein frame. This approach revealed that the Gauss-Bonnet coupling introduces a mixed term that links the Einstein tensor to the kinetic terms, along with an additional kinetic term associated with the box …

Pierce-Birkhoff conjecture is true for splines
Zehua Lai, Lek-Heng Lim
https://arxiv.org/abs/2507.07976 https://arxiv.org/pdf/2507.07…

Pierce-Birkhoff conjecture is true for splines
We prove the Pierce--Birkhoff conjecture for splines, i.e., continuous piecewise polynomials of degree $d$ in $n$ variables on a hyperplane partition of $\mathbb{R}^n$, can be written as a finite lattice combination of polynomials. We will provide a purely existential proof, followed by a more in-depth analysis that yields effective bounds.

I’m well out of my depth here: my historical knowledge to speak to the issues is thin; my cultural knowledge is almost nonexistent. Reading that Standing Together site, seeing how they’ve crafted what they write, I see just how much nuance and awareness I •don’t• have.
I’m grateful to the people who’ve helped me learn, and who’ve pointed me to these resources — in this case @… and @…. Sometimes the Internet really is good for something.
/end

Digital Quantum Simulation of the Kitaev Quantum Spin Liquid
Seongjun Park, Eun-Gook Moon
https://arxiv.org/abs/2506.09156 https://ar…

Digital Quantum Simulation of the Kitaev Quantum Spin Liquid
The ground state of the Kitaev quantum spin liquid on a honeycomb lattice is an intriguing many-body state characterized by its topological order and massive entanglement. One of the significant issues is to prepare and manipulate the ground state as well as excited states in a quantum simulator. Here, we provide a protocol to manipulate the Kitaev quantum spin liquid via digital quantum simulation. A series of unitary gates for the protocol is explicitly constructed, showing its circuit depth …

Velocity determination for time lapse surveys using residual prestack depth migration
Joerg F. Schneider
https://arxiv.org/abs/2506.04234 https://

Velocity determination for time lapse surveys using residual prestack depth migration
The presented approach aims at estimating the lateral variation of seismic velocities for a seismic timelapse survey. The monitor survey is depth migrated with the known velocity model of the base survey. An analysis is performed to determine whether the moveout to be expected for the monitor survey after residual prestack depth migration (RPSM) can be used for the velocity determination of the formation of interest. In that case the migrated response for the base horizon of the monitor survey …

Machine learning driven reconstruction of cosmic-ray air showers for next generation radio arrays
Paras Koundal (for the IceCube-Gen2 Collaboration)
https://arxiv.org/abs/2507.07219

Machine learning driven reconstruction of cosmic-ray air showers for next generation radio arrays
Surface radio antenna-based measurements of cosmic-ray air showers present significant computational challenges in accurately reconstructing physics observables, in particular, the depth of shower maximum, X$_{max}$. State-of-the-art template fitting methods rely on extensive simulation libraries, limiting scalability. This work introduces a technique utilizing graph neural networks to reconstruct key air-shower parameters, in particular, direction and shower-core, energy, and X$_{max}$. For tr…

3 Dallas Cowboys depth pieces who could start in 2025 https://insidethestar.com/3-dallas-cowboys-depth-pieces-who-could-start-in-2025

Ocean Acidification: Another Planetary Boundary Crossed (we're at 7 out of 9 now).
Researchers find damaging acidification in 40% of the ocean surface, and 60% at greater depth.
In hindsight, they conclude that the boundary should've been stricter, too.
https://onlinelibrary.wiley.com/do…

Integer inequalities between knot invariants, skein tree depth and delta-crossing numbers
Michal Jablonowski
https://arxiv.org/abs/2506.00937 https://

Integer inequalities between knot invariants, skein tree depth and delta-crossing numbers
This survey collects known (and one new) inequalities between integer-valued classical knot invariants. It features: a visual graph of the relations; proof of the new inequality relating skein tree depth and delta-crossing numbers; and examples where the inequality becomes equality.

Natura Urbana X - Perspectives 🏵️
城市自然 X - 角度 🏵️
📷 Nikon FE
🎞️Ilford FP4 Plus, expired 1995
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

Replaced article(s) found for physics.flu-dyn. https://arxiv.org/list/physics.flu-dyn/new
[1/1]:
- The semi-analytic theory and computation of finite-depth standing water waves
Ahmad Abassi, Jon Wilkening

Stratified equatorial flows in cylindrical coordinates with surface tension
Cristina Gheorghe, Andrei Stan
https://arxiv.org/abs/2506.08016 https://…

Stratified equatorial flows in cylindrical coordinates with surface tension
This paper considers a mathematical model of steady flows of an inviscid and incompressible fluid moving in the azimuthal direction. The water density varies with depth and the waves are propagating under the force of gravity, over a flat bed and with a free surface, on which acts a force of surface tension. Our solution pertains to large scale equatorial dynamics of a fluid with free surface expressed in cylindrical coordinates. We also prove a regularity result for the free surface.

An in-depth look at the US SEC's EDGAR system breach that was disclosed in 2017, as one of the key hackers, Olga Kuprina, says EDGAR remains a soft target (Liam Vaughan/Bloomberg)

VergeIO: Depth-Aware Eye Interaction on Glasses
Xiyuxing Zhang, Duc Vu, Chengyi Shen, Yuntao Wang, Yuanchun Shi, Justin Chan
https://arxiv.org/abs/2507.02187

VergeIO: Depth-Aware Eye Interaction on Glasses
There is growing industry interest in creating unobtrusive designs for electrooculography (EOG) sensing of eye gestures on glasses (e.g. JINS MEME and Apple eyewear). We present VergeIO, the first EOG-based glasses that enables depth-aware eye interaction using vergence with an optimized electrode layout and novel smart glass prototype. It can distinguish between four and six depth-based eye gestures with 83-98% accuracy using personalized models in a user study across 11 users and 1,320 gestur…

$\beta$-integrated local depth and corresponding partitioned local depth representation
Siyi Wang, Alexandre Leblanc, Paul D. McNicholas
https://arxiv.org/abs/2506.14108

$β$-integrated local depth and corresponding partitioned local depth representation
A novel local depth definition, $β$-integrated local depth ($β$-ILD), is proposed as a generalization of the local depth introduced by Paindaveine and Van Bever \cite{paindaveine2013depth}, designed to quantify the local centrality of data points. $β$-ILD inherits desirable properties from global data depth and remains robust across varying locality levels. A partitioning approach for $β$-ILD is introduced, leading to the construction of a matrix that quantifies the contribution of one poin…

Power Domain Sparse Dimensional Constellation Multiple Access (PD-SDCMA) for Enabled Flexible PONs
Yuhao Lian, Xiao Han, Xinmao Deng
https://arxiv.org/abs/2506.08053

Power Domain Sparse Dimensional Constellation Multiple Access (PD-SDCMA) for Enabled Flexible PONs
With the commercial deployment of 5G and the in-depth research of 6G, the demand for high-speed data services in the next-generation fiber optic access systems is growing increasingly. Passive optical networks (PONs) have become a research hotspot due to their characteristics of low loss, high bandwidth, and low cost. However, the traditional orthogonal multiple access (OMA-PON) has difficulty meeting the requirements of the next-generation PON for high spectral efficiency and flexibility. In t…

Nesting focusable elements is problematic. Have you seen any good blogposts, docs, or other #accessibility resources that go into *why* nesting is problematic?
I’m looking for something I could link to in a blogpost of my own, on a somewhat different topic. Preference is for something in-depth, and not marketing slop for a company (especially not for anyone affiliated with an overlay vendo…

Parallel Batch-Dynamic Algorithms for Spanners, and Extensions
Mohsen Ghaffari, Jaehyun Koo
https://arxiv.org/abs/2507.06338 https://…

Parallel Batch-Dynamic Algorithms for Spanners, and Extensions
This paper presents the first parallel batch-dynamic algorithms for computing spanners and sparsifiers. Our algorithms process any batch of edge insertions and deletions in an $n$-node undirected graph, in $\text{poly}(\log n)$ depth and using amortized work near-linear in the batch size. Our concrete results are as follows: - Our base algorithm maintains a spanner with $(2k-1)$ stretch and $\tilde{O}(n^{1+1/k})$ edges, for any $k\geq 1$. - Our first extension maintains a sparse spanner wit…

Holographic Projection and Cyber Attack Surface: A Physical Analogy for Digital Security
Ricardo Queiroz de Araujo Fernandes, Anderson Santos, Daniel Maier de Carvalho, Andr\'e Luiz Bandeira Molina
https://arxiv.org/abs/2507.03136

Holographic Projection and Cyber Attack Surface: A Physical Analogy for Digital Security
This article presents an in-depth exploration of the analogy between the Holographic Principle in theoretical physics and cyber attack surfaces in digital security. Building on concepts such as black hole entropy and AdS/CFT duality, it highlights how complex infrastructures project their vulnerabilities onto their external interfaces. The paper draws a parallel between a black hole's event horizon, which encodes all internal information, and the attack surface, which reflects the internal arch…

The 4th Dimension for Scaling Model Size
Ruike Zhu, Hanwen Zhang, Tianyu Shi, Chi Wang, Tianyi Zhou, Zengyi Qin
https://arxiv.org/abs/2506.18233 https://…

The 4th Dimension for Scaling Model Size
Scaling the size of large language models typically involves three dimensions: depth, width, and the number of parameters. In this work, we explore a fourth dimension, virtual logical depth (VLD), which increases the effective algorithmic depth without changing the overall parameter count by reusing parameters within the model. Although parameter reuse is not a new concept, its potential and characteristics in model scaling have not been thoroughly studied. Through carefully designed controlled…

Green functions for positive-depth Deligne--Lusztig induction
Charlotte Chan, Masao Oi
https://arxiv.org/abs/2506.04449 https://arxiv…

Green functions for positive-depth Deligne--Lusztig induction
Under a largeness assumption on the size of the residue field, we give an explicit description of the positive-depth Deligne--Lusztig induction of unramified elliptic pairs $(T,θ)$. When $θ$ is regular, we show that positive-depth Deligne--Lusztig induction gives a geometric realization of Kaletha's Howe-unramified regular $L$-packets. This is obtained as an immediate corollary of a very simple "litmus test" characterization theorem which we foresee will have interesting future applications t…

Understanding and Controlling Repetition Neurons and Induction Heads in In-Context Learning
Nhi Hoai Doan, Tatsuya Hiraoka, Kentaro Inui
https://arxiv.org/abs/2507.07810

Understanding and Controlling Repetition Neurons and Induction Heads in In-Context Learning
This paper investigates the relationship between large language models' (LLMs) ability to recognize repetitive input patterns and their performance on in-context learning (ICL). In contrast to prior work that has primarily focused on attention heads, we examine this relationship from the perspective of skill neurons, specifically repetition neurons. Our experiments reveal that the impact of these neurons on ICL performance varies depending on the depth of the layer in which they reside. By comp…

Optimal T depth quantum circuits for implementing arbitrary Boolean functions
Suman Dutta, Anik Basu Bhaumik, Anupam Chattopadhyay, Subhamoy Maitra
https://arxiv.org/abs/2506.01542

Optimal T depth quantum circuits for implementing arbitrary Boolean functions
In this paper we present a generic construction to obtain an optimal T depth quantum circuit for any arbitrary $n$-input $m$-output Boolean function $f: \{0,1\}^n \rightarrow \{0,1\}^m$ having algebraic degree $k\leq n$, and it achieves an exact Toffoli (and T) depth of $\lceil \log_2 k \rceil$. This is a broader generalization of the recent result establishing the optimal Toffoli (and consequently T) depth for multi-controlled Toffoli decompositions (Dutta et al., Phys. Rev. A, 2025). We achie…

Raiders offensive depth chart following minicamp and heading into training camp https://raiderswire.usatoday.com/story/sports/nfl/raiders/2025/06/24/raiders-offensive-depth-chart-in-mi…

Constant-depth circuits for polynomial GCD over any characteristic
Somnath Bhattacharjee, Mrinal Kumar, Shanthanu Rai, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
https://arxiv.org/abs/2506.23220

Constant-depth circuits for polynomial GCD over any characteristic
We show that the GCD of two univariate polynomials can be computed by (piece-wise) algebraic circuits of constant depth and polynomial size over any sufficiently large field, regardless of the characteristic. This extends a recent result of Andrews & Wigderson who showed such an upper bound over fields of zero or large characteristic. Our proofs are based on a recent work of Bhattacharjee, Kumar, Rai, Ramanathan, Saptharishi \& Saraf that shows closure of constant depth algebraic circuits und…

A Review on Score-based Generative Models for Audio Applications
Ge Zhu, Yutong Wen, Zhiyao Duan
https://arxiv.org/abs/2506.08457 https://

A Review on Score-based Generative Models for Audio Applications
Diffusion models have emerged as powerful deep generative techniques, producing high-quality and diverse samples in applications in various domains including audio. These models have many different design choices suitable for different applications, however, existing reviews lack in-depth discussions of these design choices. The audio diffusion model literature also lacks principled guidance for the implementation of these design choices and their comparisons for different applications. This su…

Urban Solitude III 🈳
城市孤独 III 🈳
📷 Pentax MX
🎞️Fujifilm Neopan SS, expired 1995
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

Efficient Algorithms for Quantum Hashing
Ilnar Zinnatullin, Kamil Khadiev
https://arxiv.org/abs/2507.07002 https://arxiv.org/pdf/2507…

Efficient Algorithms for Quantum Hashing
Quantum hashing is a useful technique that allows us to construct memory-efficient algorithms and secure quantum protocols. First, we present a circuit that implements the phase form of quantum hashing using $2^{n-1}$ CNOT gates, where n is the number of control qubits. Our method outperforms existing approaches and reduces the circuit depth. Second, we propose an algorithm that provides a trade-off between the number of CNOT gates (and consequently, the circuit depth) and the precision of rota…

Stokes Waves in Water of Finite Depth
Eleanor Byrnes, Bernard Deconinck, Anastassiya Semenova
https://arxiv.org/abs/2506.03436 https://

Stokes Waves in Water of Finite Depth
Periodic water waves of permanent form traveling at constant speed, the so-called Stokes waves, are studied in water of fixed finite depth using methods previously used in water of infinite depth. We apply our methods to waves of varying steepness over a range of fixed depths in order to determine how a number of physical quantities related to the waves change as the steepness of the waves increases. Finally, we examine the Taylor sign condition for these waves, as well as the complex singulari…

Edge statistics for singular values of products of rectangular complex Ginibre matrices
Yandong Gu
https://arxiv.org/abs/2507.07431 https://

Edge statistics for singular values of products of rectangular complex Ginibre matrices
We investigate the edge statistics of singular values for products of independent rectangular complex Ginibre matrices. Building on work \cite{LWW23}, which introduced the depth-to-width ratio (DWR) and established the critical kernel, we show that the DWR acts as a sharp threshold: local statistics exhibit Gaussian fluctuations in the low-DWR regime, while the Airy kernel emerges at the soft edge in the high-DWR regime.

Anomaly diagnosis via symmetry restriction in two-dimensional lattice systems
Kyle Kawagoe, Wilbur Shirley
https://arxiv.org/abs/2507.07430 https://…

Anomaly diagnosis via symmetry restriction in two-dimensional lattice systems
We describe a method for computing the anomaly of any finite unitary symmetry group $G$ acting by finite-depth quantum circuits on a two-dimensional lattice system. The anomaly is characterized by an index valued in the cohomology group $H^4(G,U(1))$, which generalizes the Else-Nayak index for locality preserving symmetries of quantum spin chains. We show that a nontrivial index precludes the existence of a trivially gapped symmetric Hamiltonian; it is also an obstruction to ``onsiteability" of…

Cowboys spending $35 million on receivers in 2025, depth may finally get bang for buck https://cowboyswire.usatoday.com/story/sports/nfl/cowboys/2025/07/07/cowboys-top-5-wrs-seem-locked-i…

An in depth look at the Procrustes-Wasserstein distance: properties and barycenters
Davide Adamo, Marco Corneli, Manon Vuillien, Emmanuelle Vila
https://arxiv.org/abs/2507.00894

An in depth look at the Procrustes-Wasserstein distance: properties and barycenters
Due to its invariance to rigid transformations such as rotations and reflections, Procrustes-Wasserstein (PW) was introduced in the literature as an optimal transport (OT) distance, alternative to Wasserstein and more suited to tasks such as the alignment and comparison of point clouds. Having that application in mind, we carefully build a space of discrete probability measures and show that over that space PW actually is a distance. Algorithms to solve the PW problems already exist, however we…

Experimental observation of subabsorption
D. C. Gold, U. Saglam, S. Carpenter, A. Yadav, M. Beede, T. G. Walker, M. Saffman, D. D. Yavuz
https://arxiv.org/abs/2506.09872

Experimental observation of subabsorption
We predict and experimentally demonstrate a new type of collective (cooperative) coupling effect where a disordered atomic ensemble absorbs light with a rise-time longer (i. e., at a rate slower) than what is dictated by single-atom physics. This effect, which we name subabsorption, can be viewed as the absorptive analog of subradiance. The experiment is performed using a dilute ensemble of ultracold $^{87}$Rb atoms with a low optical depth, and time-resolving the absorption of a weak (tens of …

This https://arxiv.org/abs/2504.18253 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

Depth-Constrained ASV Navigation with Deep RL and Limited Sensing
Autonomous Surface Vehicles (ASVs) play a crucial role in maritime operations, yet their navigation in shallow-water environments remains challenging due to dynamic disturbances and depth constraints. Traditional navigation strategies struggle with limited sensor information, making safe and efficient operation difficult. In this paper, we propose a reinforcement learning (RL) framework for ASV navigation under depth constraints, where the vehicle must reach a target while avoiding unsafe areas…

Raiders offensive depth chart following minicamp and heading into training camp https://raiderswire.usatoday.com/story/sports/nfl/raiders/2025/06/24/raiders-offensive-depth-chart-in-mi…

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees
Mohsen Ghaffari, Jaehyun Koo
https://arxiv.org/abs/2507.06334 https://

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees
We present the first parallel batch-dynamic algorithm for approximating coreness decomposition with worst-case update times. Given any batch of edge insertions and deletions, our algorithm processes all these updates in $ \text{poly}(\log n)$ depth, using a worst-case work bound of $b\cdot \text{poly}(\log n)$ where $b$ denotes the batch size. This means the batch gets processed in $\tilde{O}(b/p)$ time, given $p$ processors, which is optimal up to logarithmic factors. Previously, an algorithm …

This https://arxiv.org/abs/2506.01933 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCV_…

E3D-Bench: A Benchmark for End-to-End 3D Geometric Foundation Models
Spatial intelligence, encompassing 3D reconstruction, perception, and reasoning, is fundamental to applications such as robotics, aerial imaging, and extended reality. A key enabler is the real-time, accurate estimation of core 3D attributes (camera parameters, point clouds, depth maps, and 3D point tracks) from unstructured or streaming imagery. Inspired by the success of large foundation models in language and 2D vision, a new class of end-to-end 3D geometric foundation models (GFMs) has emer…

On the solution operators arising from the gas-liquid two-phase problem in unbounded domains with finite depth
Miao Tu, Xin Zhang
https://arxiv.org/abs/2507.06498 https://arxiv.org/pdf/2507.06498 https://arxiv.org/html/2507.06498
arXiv:2507.06498v1 Announce Type: new
Abstract: This paper studies some evolution equations arising from the sharp interface problem of the compressible-incompressible Navier-Stokes equations in unbounded domains in $\mathbb{R}^N (N\geq2)$, where the viscous gases initially occupy the upper half space and the viscous liquids below initially lie in the strip-like domain. In order to establish the maximal $L_p$-$L_q$ regularity estimates of the evolution problem, we construct the R-solver of the resolvent problem associated to the gas-liquid two-phase operator. The crucial part of our proof lies in the analysis of the explicit resolvent operators defined in the unbounded domains with flat boundaries.
toXiv_bot_toot

In the Air - Outside of the Window ✈️ ☁️
在空中 - 窗外 ✈️ ☁️
📷 Nikon FE
🎞️FOMAPAN Action 400
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Higher-Order Network Representation of J. S. Bach's Solo Violin Sonatas and Partitas: Topological and Geometrical Explorations
Dima Mrad, Sara Najem
https://arxiv.org/abs/2506.08540

Higher-Order Network Representation of J. S. Bach's Solo Violin Sonatas and Partitas: Topological and Geometrical Explorations
Music is inherently complex, with structures and interactions that unfold across multiple layers. Complex networks have emerged as powerful structures for the quantitative analysis of Western classical music, revealing significant features of its harmonic and structural organization. Although notable works have used these approaches to study music, dyadic representations of interactions fall short in conveying the underlying complexity and depth. In recent years, the limitations of traditional …

Designs from magic-augmented Clifford circuits
Yuzhen Zhang, Sagar Vijay, Yingfei Gu, Yimu Bao
https://arxiv.org/abs/2507.02828 https://

Designs from magic-augmented Clifford circuits
We introduce magic-augmented Clifford circuits -- architectures in which Clifford circuits are preceded and/or followed by constant-depth circuits of non-Clifford (``magic") gates -- as a resource-efficient way to realize approximate $k$-designs, with reduced circuit depth and usage of magic. We prove that shallow Clifford circuits, when augmented with constant-depth circuits of magic gates, can generate approximate unitary and state $k$-designs with $ε$ relative error. The total circuit depth…

This https://arxiv.org/abs/2505.24305 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

SR3D: Unleashing Single-view 3D Reconstruction for Transparent and Specular Object Grasping
Recent advancements in 3D robotic manipulation have improved grasping of everyday objects, but transparent and specular materials remain challenging due to depth sensing limitations. While several 3D reconstruction and depth completion approaches address these challenges, they suffer from setup complexity or limited observation information utilization. To address this, leveraging the power of single view 3D object reconstruction approaches, we propose a training free framework SR3D that enables…

Closure under factorization from a result of Furstenberg
Somnath Bhattacharjee, Mrinal Kumar, Shanthanu S. Rai, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
https://arxiv.org/abs/2506.23214

Closure under factorization from a result of Furstenberg
We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then all its factors can be computed by small constant-depth circuits or formulas respectively. Our result turns out to be an elementary consequence of a fundamental and surprising result of Furstenberg from the 1960s, which gives a non-iterative description of t…

Hype growing for 3rd-string Cowboy, and for good reason https://cowboyswire.usatoday.com/story/sports/nfl/cowboys/2025/07/09/brevyn-spann-ford-cowboys-getting-hype-2025/84523687007/

Human-AI Alignment of Multimodal Large Language Models with Speech-Language Pathologists in Parent-Child Interactions
Weiyan Shi, Kenny Tsu Wei Choo
https://arxiv.org/abs/2506.05879

Human-AI Alignment of Multimodal Large Language Models with Speech-Language Pathologists in Parent-Child Interactions
Joint attention is a critical marker of early social-communicative development, yet remains difficult for caregivers to assess without expert guidance. In this work, we explore how multimodal large language models (MLLMs) can be aligned with the reasoning processes of speech-language pathologists (SLPs) to support the interpretation of everyday parent-child interactions. We conducted in-depth interviews and video annotation studies with three experienced SLPs to uncover how they evaluate joint …

DiFuse-Net: RGB and Dual-Pixel Depth Estimation using Window Bi-directional Parallax Attention and Cross-modal Transfer Learning
Kunal Swami, Debtanu Gupta, Amrit Kumar Muduli, Chirag Jaiswal, Pankaj Kumar Bajpai
https://arxiv.org/abs/2506.14709

DiFuse-Net: RGB and Dual-Pixel Depth Estimation using Window Bi-directional Parallax Attention and Cross-modal Transfer Learning
Depth estimation is crucial for intelligent systems, enabling applications from autonomous navigation to augmented reality. While traditional stereo and active depth sensors have limitations in cost, power, and robustness, dual-pixel (DP) technology, ubiquitous in modern cameras, offers a compelling alternative. This paper introduces DiFuse-Net, a novel modality decoupled network design for disentangled RGB and DP based depth estimation. DiFuse-Net features a window bi-directional parallax atte…

Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits
Jefferson D. S. Silva, Adenilton J. da Silva
https://arxiv.org/abs/2507.00400

Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits
The synthesis of quantum operators involves decomposing general quantum gates into the gate set supported by a given quantum device. Multi-controlled gates are essential components in this process. In this work, we present improved decompositions of multi-controlled NOT gates with logarithmic depth using a single ancilla qubit, while also reducing the constant factors in the circuit depth compared to previous work. We optimize a previously proposed decomposition of multi-target, multi-controlle…

Assessing Cowboys' OL reveals questions on edge, excess depth inside https://cowboyswire.usatoday.com/story/sports/nfl/cowboys/2025/06/26/assessing-cowboys-ol-reveals-questions-on-ed…

Urban Snaps II 📸
城市抓拍 II 📸
📷 Pentax MX
🎞️Fujifilm Neopan SS, expired 1995
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

Monocular One-Shot Metric-Depth Alignment for RGB-Based Robot Grasping
Teng Guo, Baichuan Huang, Jingjin Yu
https://arxiv.org/abs/2506.17110 https://

Monocular One-Shot Metric-Depth Alignment for RGB-Based Robot Grasping
Accurate 6D object pose estimation is a prerequisite for successfully completing robotic prehensile and non-prehensile manipulation tasks. At present, 6D pose estimation for robotic manipulation generally relies on depth sensors based on, e.g., structured light, time-of-flight, and stereo-vision, which can be expensive, produce noisy output (as compared with RGB cameras), and fail to handle transparent objects. On the other hand, state-of-the-art monocular depth estimation models (MDEMs) provid…

VOTE: Vision-Language-Action Optimization with Trajectory Ensemble Voting
Juyi Lin, Amir Taherin, Arash Akbari, Arman Akbari, Lei Lu, Guangyu Chen, Taskin Padir, Xiaomeng Yang, Weiwei Chen, Yiqian Li, Xue Lin, David Kaeli, Pu Zhao, Yanzhi Wang
https://arxiv.org/abs/2507.05116

VOTE: Vision-Language-Action Optimization with Trajectory Ensemble Voting
Recent large-scale Vision Language Action (VLA) models have shown superior performance in robotic manipulation tasks guided by natural language. However, their generalization remains limited when applied to novel objects or unfamiliar environments that lie outside the training distribution. To address this, many existing approaches integrate additional components such as depth estimation, segmentation, or even diffusion to improve generalization, at the cost of adding significant computation ov…

Dallas Cowboys add veteran CB depth in latest roster shuffle https://www.si.com/nfl/cowboys/news/dallas-cowboys-add-veteran-cornerback-depth-latest-roster-shuffle

This https://arxiv.org/abs/2405.01786 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

On computational complexity and average-case hardness of shallow-depth boson sampling
Boson sampling, a computational task believed to be classically hard to simulate, is expected to hold promise for demonstrating quantum computational advantage using near-term quantum devices. However, noise in experimental implementations poses a significant challenge, potentially rendering boson sampling classically simulable and compromising its classical intractability. Numerous studies have proposed classical algorithms under various noise models that can efficiently simulate boson samplin…

DreamGrasp: Zero-Shot 3D Multi-Object Reconstruction from Partial-View Images for Robotic Manipulation
Young Hun Kim, Seungyeon Kim, Yonghyeon Lee, Frank Chongwoo Park
https://arxiv.org/abs/2507.05627

DreamGrasp: Zero-Shot 3D Multi-Object Reconstruction from Partial-View Images for Robotic Manipulation
Partial-view 3D recognition -- reconstructing 3D geometry and identifying object instances from a few sparse RGB images -- is an exceptionally challenging yet practically essential task, particularly in cluttered, occluded real-world settings where full-view or reliable depth data are often unavailable. Existing methods, whether based on strong symmetry priors or supervised learning on curated datasets, fail to generalize to such scenarios. In this work, we introduce DreamGrasp, a framework tha…

Dallas Cowboys add veteran CB depth in latest roster shuffle https://www.si.com/nfl/cowboys/news/dallas-cowboys-add-veteran-cornerback-depth-latest-roster-shuffle

Will it glue? On short-depth designs beyond the unitary group
Lorenzo Grevink, Jonas Haferkamp, Markus Heinrich, Jonas Helsen, Marcel Hinsche, Thomas Schuster, Zolt\'an Zimbor\'as
https://arxiv.org/abs/2506.23925

Will it glue? On short-depth designs beyond the unitary group
We provide a range of results on several groups of broad interest in quantum information science: the Clifford group, the orthogonal group, the unitary symplectic groups, and the matchgate group. For all of these groups, we prove that analogues of unitary designs cannot be generated by any circuit ensemble with light-cones that are smaller than the system size. This implies linear lower bounds on the circuit depth in one-dimensional systems. For the Clifford and orthogonal group, we moreover sh…

Bridging Perception and Action: Spatially-Grounded Mid-Level Representations for Robot Generalization
Jonathan Yang, Chuyuan Kelly Fu, Dhruv Shah, Dorsa Sadigh, Fei Xia, Tingnan Zhang
https://arxiv.org/abs/2506.06196

Bridging Perception and Action: Spatially-Grounded Mid-Level Representations for Robot Generalization
In this work, we investigate how spatially grounded auxiliary representations can provide both broad, high-level grounding as well as direct, actionable information to improve policy learning performance and generalization for dexterous tasks. We study these mid-level representations across three critical dimensions: object-centricity, pose-awareness, and depth-awareness. We use these interpretable mid-level representations to train specialist encoders via supervised learning, then feed them as…

Cowboys depth at edge rusher may be envy of all other NFL teams if they can fit all on 53 https://cowboyswire.usatoday.com/story/sports/nfl/cowboys/2025/07/03/edge-rusher-is-clearly-cow…

Quantum algorithm for edge detection in digital grayscale images
Mohit Rohida, Alok Shukla, Prakash Vedula
https://arxiv.org/abs/2507.06642 https://…

Quantum algorithm for edge detection in digital grayscale images
In this work, we propose a novel quantum algorithm for edge detection in digital grayscale images, based on the sequency-ordered Walsh-Hadamard transform. The proposed method significantly improves upon existing quantum techniques for edge detection by using a quantum algorithm for the sequency-ordered Walsh-Hadamard transform, achieving a circuit depth of $\mathcal{O}(n)$ (where $n$ is the number of qubits). This represents a notable enhancement over the Quantum Fourier Transform (QFT), which …

Globally Consistent RGB-D SLAM with 2D Gaussian Splatting
Xingguang Zhong, Yue Pan, Liren Jin, Marija Popovi\'c, Jens Behley, Cyrill Stachniss
https://arxiv.org/abs/2506.00970

Globally Consistent RGB-D SLAM with 2D Gaussian Splatting
Recently, 3D Gaussian splatting-based RGB-D SLAM displays remarkable performance of high-fidelity 3D reconstruction. However, the lack of depth rendering consistency and efficient loop closure limits the quality of its geometric reconstructions and its ability to perform globally consistent mapping online. In this paper, we present 2DGS-SLAM, an RGB-D SLAM system using 2D Gaussian splatting as the map representation. By leveraging the depth-consistent rendering property of the 2D variant, we pr…