Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

3056099141,218 · Jun 202019922001200920172026
48 results for neural probing function

CwA optimizes search performance by jointly learning a balanced database partition and a neural probing function.

problem Suboptimal search performance due to mismatched database and query distributions.
method CwA jointly learns a balanced database partition and a neural probing function to optimize search performance directly for the query distribution.
result CwA achieves up to 4.7x throughput over state-of-the-art methods at equal recall.

We identify spectral conditions for reliable neural probe interpretation.

problem Unreliable performance of linear probes in interpreting neural representations.
method Formalized Spectral Identifiability Principle (SIP) based on eigengap and Fisher error.
result Reliability of neural probes depends on the eigengap relative to Fisher estimation error.

A probing scheme is considered with an accessible and controllable qubit, used to probe an out-of equilibrium system consisting of a second qubit interacting with an environment. Quantum spontaneous synchronization between the probe and the system emerges in this model and, by tuning the probe frequency, can occur both…

2019-01-16abs ↗pdf ↗

New RL method learns value function for many policies using few key states.

problem Evaluate and improve policies in continuous control problems.
method Combines actor-critic architecture and policy embedding to learn a single value function for many policies.
result Value function minimizes prediction error by learning a small set of 'probing states' and their impact on policies' returns.

We study the statistical behavior of reasoning probes in a stylized model of iterative computation inspired by neural algorithmic reasoning. The underlying computation is given by a looped Boolean circuit whose graph is a perfect νν-ary tree (ν2ν\ge 2), with outputs recursively fed back as inputs across computation ro…

2026-02-03abs ↗pdf ↗

BoC probe assesses neural network confidence coherence, revealing architecture-specific uncertainty.

problem Poor calibration and OOD detection in neural networks.
method Bag-of-Coins (BoC) probe compares softmax confidence to pairwise dominance probabilities.
result BoC reveals clear ID/OOD separation for some architectures but not others.

Paper introduces Manifold Probe for discovering representation manifolds in superposition.

problem Discovering representation manifolds in complex superposition representations.
method Generalizes linear regression probes to learn feature spaces and directions in superposition representations.
result Demonstrates Manifold Probe on Llama 2-7b representations, finding causally involved manifolds in model behaviour.

OLPA optimizes online user-centric selection with probing, achieving near-optimal regret bounds.

problem Sequential decision-making with unknown resources and rewards.
method Probing-augmented user-centric selection (PUCS) framework, greedy probing algorithm, OLPA algorithm.
result OLPA achieves a near-optimal regret bound of O(T+ln2T)\mathcal{O}(\sqrt{T} + \ln^{2} T) for online settings.

This paper explores what causal structures can be distinguished by observational and interventional probing schemes.

problem Identifying causal structures with latent variables using observational and interventional data.
method Investigates the power of different probing schemes (observation vs. intervention) to distinguish causal structures.
result Two causal structures are indistinguishable if they share the same mDAG structure.

Neural network models have a reputation for being black boxes. We propose to monitor the features at every layer of a model and measure how suitable they are for classification. We use linear classifiers, which we refer to as "probes", trained entirely independently of the model itself. This helps us better understand …

2016-10-05abs ↗pdf ↗

Improved loss functions adapt to weight-space anisotropy, outperforming isotropic counterparts.

problem Adapting to the anisotropic nature of deep weight spaces for better performance.
method Refined local entropic loss functions restricted to a subset of weights, exploiting anisotropy.
result Partial local entropies outperform isotropic counterparts on image classification tasks.

New method certifies neural network function space norms from point evaluations.

problem Certifying neural network function space norms from point evaluations alone.
method Combining interval arithmetic enclosures, adaptive marking/refinement, and quadrature-based aggregation.
result Certified computation of LpL^p, W1,pW^{1,p}, and W2,pW^{2,p} norms.

Bayesian optimization has recently emerged as a popular and efficient tool for global optimization and hyperparameter tuning. Currently, the established Bayesian optimization practice requires a user-defined bounding box which is assumed to contain the optimizer. However, when little is known about the probed objective…

2015-08-14abs ↗pdf ↗

Neural networks classify OOD images by their nearest neighbor in training data.

problem Understanding out-of-distribution prediction behavior of neural networks.
method Nearest category generalization (NCG) measure to assess OOD prediction accuracy.
result Adversarially robust networks have higher NCG accuracy than natural training, indicating local regularization impacts decision regions.

Paper analyzes why deeper layers of ViTs perform worse on out-of-distribution tasks.

problem Performance degradation of intermediate layers in ViTs under distribution shift.
method Extensive linear probing experiments across various benchmarks and fine-grained analysis of transformer modules.
result Probing feedforward network activations yields best performance under significant distribution shift.

The ability of modeling the other agents, such as understanding their intentions and skills, is essential to an agent's interactions with other agents. Conventional agent modeling relies on passive observation from demonstrations. In this work, we propose an interactive agent modeling scheme enabled by encouraging an a…

2018-10-01abs ↗pdf ↗

New framework to test neural network representation similarity measures.

problem Disagreements among dissimilarity measures in neural networks.
method Statistical testing framework to evaluate measures based on functional behavior.
result Current metrics have different weaknesses; a classical baseline performs surprisingly well.

Study examines flaws in probing LLMs' knowledge and introduces a new method.

problem Flaws in existing methods for probing the veracity of LLMs' internal knowledge.
method sAwMIL (Sparse-Aware Multiple-Instance Learning) combining multiple-instance learning with conformal prediction.
result LLMs encode a third type of signal distinct from true and false.

We present a new trace estimator of the matrix whose explicit form is not given but its matrix multiplication to a vector is available. The form of the estimator is similar to the Hutchison stochastic trace estimator, but instead of the random noise vectors in Hutchison estimator, we use small number of probing vectors…

2016-06-16abs ↗pdf ↗

We study inverse problems consisting on determining medium properties using the responses to probing waves from the machine learning point of view. Based on the understanding of propagation of waves and their nonlinear interactions, we construct a deep convolutional neural network in which the parameters are used to cl…

2018-11-09abs ↗pdf ↗

Improved unsupervised probing for ranking tasks using Contrast-Consistent Ranking.

problem Improving self-consistency in language model rankings.
method Adapting Contrast-Consistent Search (CCS) to Contrast-Consistent Ranking (CCR) for ranking tasks.
result CCR probing outperforms prompting techniques across different models and datasets.

In this paper we present an algorithm for rapid Bayesian analysis that combines the benefits of nested sampling and artificial neural networks. The blind accelerated multimodal Bayesian inference (BAMBI) algorithm implements the MultiNest package for nested sampling as well as the training of an artificial neural netwo…

2011-10-13abs ↗pdf ↗

This research discovers model architecture and training dataset characteristics through strategic input probing.

problem Discovering model architecture and training dataset characteristics in black box models.
method Structured input probes and model outputs are used to train a deep classifier for image and text classification.
result The approach successfully distinguishes between different image and text datasets and architectures.

Proves accuracy guarantees for self-supervised learning with correlated positive pairs.

problem Lack of theoretical guarantees for self-supervised learning with correlated positive pairs.
method Novel augmentation graph concept and spectral decomposition loss.
result Provably accurate features under linear probe evaluation.

Study quantifies information flow in neural networks using relative entropy and RG analogy.

problem Quantifying information flow in deep neural networks.
method Explicit computation of relative entropy in Ising models and feedforward neural networks.
result Monotonic increase of relative entropy to an asymptotic value, confirming connection to c-theorem.

Researchers create holographic super-embeddings for M5 and M2 branes.

problem No concrete examples of super-embeddings for M5 and M2 branes existed.
method Constructed explicit holographic super-embeddings of probe M5 and M2 branes into their super-AdS backgrounds.
result Explicit holographic super-embeddings of M5 and M2 branes were successfully constructed.

Deep learning models outperform classical methods in forecasting neural activity.

problem Improving forecasting of neural activity using deep learning models.
method Systematic evaluation of eight probabilistic deep learning models against classical statistical models and baseline methods.
result Several deep learning models consistently outperform classical approaches in forecasting neural activity.

New method tightens federated probe-logit distillation rates under varying bandwidths.

problem Estimating conditional distributions in federated learning with heterogeneous bandwidth constraints.
method Developed a new federated probe-logit distillation (FPLD) method with optimal allocation for varying bandwidths.
result Achieved matching lower and upper bounds for the minimax rate under heterogeneous bandwidths.

We study supersymmetric probe M5-branes in the AdS_4 solution that arises from M5-branes wrapped on a hyperbolic 3-manifold M_3. This amounts to introducing internal defects within the framework of the 3d-3d correspondence. The BPS condition for a probe M5-brane extending along all of AdS_4 requires it to wrap a surfac…

2014-07-01abs ↗pdf ↗

This work justifies neural collapse under MSE loss and analyzes the optimization landscape.

problem Understanding neural collapse in deep neural networks under MSE loss.
method Global landscape analysis of vanilla nonconvex MSE loss.
result The only global minimizers are neural collapse solutions.