English
Related papers

Related papers: TT-FSI: Scalable Faithful Shapley Interactions via…

200 papers

Two-dimensional materials-based field-effect transistors (2DM-FETs) exhibit both ambipolar and unipolar transport types. To physically and compactly cover both cases, we put forward a quasi-Fermi-level phase space (QFLPS) approach to model…

In the current era of vast data and transparent machine learning, it is essential for techniques to operate at a large scale while providing a clear mathematical comprehension of the internal workings of the method. Although there already…

Machine Learning · Statistics 2024-02-05 David Rügamer

In this work, we firstly apply the Train-Tensor (TT) networks to construct a compact representation of the classical Multilayer Perceptron, representing a reduction of up to 95% of the coefficients. A comparative analysis between tensor…

Machine Learning · Computer Science 2021-03-31 M. Nazareth da Costa , R. Attux , A. Cichocki , J. M. T. Romano

Unlike the time-division duplexing (TDD) systems, the downlink (DL) and uplink (UL) channels are not reciprocal anymore in the case of frequency-division duplexing (FDD). However, some long-term parameters, e.g. the time delays and angles…

Information Theory · Computer Science 2017-08-02 Xiliang Luo , Penghao Cai , Xiaoyu Zhang , Die Hu , Cong Shen

We propose Guided Speculative Inference (GSI), a novel algorithm for efficient reward-guided decoding in large language models. GSI combines soft best-of-$n$ test-time scaling with a reward model $r(x,y)$ and speculative samples from a…

Machine Learning · Computer Science 2026-04-28 Jonathan Geuter , Youssef Mroueh , David Alvarez-Melis

Matrix-matrix multiplication is a basic operation in linear algebra and an essential building block for a wide range of algorithms in various scientific fields. Theory and implementation for the dense, square matrix case are well-developed.…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-06-01 Alfio Lazzaro , Joost VandeVondele , Juerg Hutter , Ole Schuett

Today's autonomous agents, largely driven by foundation models (FMs), can understand natural language instructions and solve long-horizon tasks with human-like reasoning. However, current human-robot interaction largely follows a one-way…

Robotics · Computer Science 2026-03-17 Linus Nwankwo , Bjoern Ellensohn , Christian Rauch , Elmar Rueckert

High-dimensional sparse data emerge in many critical application domains such as healthcare and cybersecurity. To extract meaningful insights from massive volumes of these multi-dimensional data, scientists employ unsupervised analysis…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-18 Jan Laukemann , Ahmed E. Helal , S. Isaac Geronimo Anderson , Fabio Checconi , Yongseok Soh , Jesmin Jahan Tithi , Teresa Ranadive , Brian J Gravelle , Fabrizio Petrini , Jee Choi

This work focuses on developing efficient post-hoc explanations for quantum AI algorithms. In classical contexts, the cooperative game theory concept of the Shapley value adapts naturally to post-hoc explanations, where it can be used to…

Quantum Physics · Physics 2025-04-18 Iain Burge , Michel Barbeau , Joaquin Garcia-Alfaro

Non-asymptotic convergence analysis of quasi-Newton methods has gained attention with a landmark result establishing an explicit local superlinear rate of O$((1/\sqrt{t})^t)$. The methods that obtain this rate, however, exhibit a well-known…

Optimization and Control · Mathematics 2023-10-19 Zhan Gao , Aryan Mokhtari , Alec Koppel

An $f$-edge fault-tolerant distance sensitive oracle ($f$-DSO) with stretch $\sigma \ge 1$ is a data structure that preprocesses a given undirected, unweighted graph $G$ with $n$ vertices and $m$ edges, and a positive integer $f$. When…

Data Structures and Algorithms · Computer Science 2024-08-07 Davide Bilò , Shiri Chechik , Keerti Choudhary , Sarel Cohen , Tobias Friedrich , Simon Krogmann , Martin Schirneck

The Discrete Fourier Transform (DFT) is essential for various applications ranging from signal processing to convolution and polynomial multiplication. The groundbreaking Fast Fourier Transform (FFT) algorithm reduces DFT time complexity…

Hardware Architecture · Computer Science 2023-04-06 Orian Leitersdorf , Yahav Boneh , Gonen Gazit , Ronny Ronen , Shahar Kvatinsky

Existing methods for few-shot speaker identification (FSSI) obtain high accuracy, but their computational complexities and model sizes need to be reduced for lightweight applications. In this work, we propose a FSSI method using a…

Audio and Speech Processing · Electrical Eng. & Systems 2023-06-01 Yanxiong Li , Hao Chen , Wenchang Cao , Qisheng Huang , Qianhua He

We propose a five-stage methodology for causal feature analysis in transformer language models (probe design, feature extraction, causal validation, robustness testing, and deployment integration) and demonstrate it end-to-end on GPT-2…

Computation and Language · Computer Science 2026-05-22 Caleb Munigety

The efficient computation of observables beyond the total energy is a key challenge and opportunity for fault-tolerant quantum computing approaches in quantum chemistry. Here we consider the symmetry-adapted perturbation theory (SAPT)…

Thermal management in 3D ICs is increasingly challenging due to higher power densities. Traditional PDE-solving-based methods, while accurate, are too slow for iterative design. Machine learning approaches like FNO provide faster…

Machine Learning · Computer Science 2025-10-21 Zhen Huang , Hong Wang , Wenkai Yang , Muxi Tang , Depeng Xie , Ting-Jung Lin , Yu Zhang , Wei W. Xing , Lei He

Trustworthiness of artificially intelligent agents is vital for the acceptance of human-machine teaming in industrial manufacturing environments. Predictable behaviours and explainable (and understandable) rationale allow humans…

Artificial Intelligence · Computer Science 2023-05-22 Vedran Galetić , Alistair Nottle

We apply the Tensor-Backflow method to investigate the Fermi-Hubbard model on two-dimensional lattices up to 256 sites, exploring various interaction strengths $U$, electron fillings $n$, next-nearest-neighbor hopping $t'$, and boundary…

Strongly Correlated Electrons · Physics 2026-03-27 Xiao Liang

Coalition formation is often modeled as a static equilibrium problem, neglecting the dynamic processes governing how agents self-organize. This paper proposes a dynamic split-and-merge framework that balances two conflicting economic…

Computer Science and Game Theory · Computer Science 2026-03-19 Quanyan Zhu , Zhengye Han

We introduce a general purpose algorithm for rapidly computing certain types of oscillatory integrals which frequently arise in problems connected to wave propagation and general hyperbolic equations. The problem is to evaluate numerically…

Numerical Analysis · Mathematics 2007-05-23 Emmanuel Candes , Laurent Demanet , Lexing Ying