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.

169,051 papers · 148 categories

Trend · papers per month

6.3%12.5%18.8%25.0% · Apr 199419922001200920182026
48 results for probe characterization

Machine learning improves probing of quantum systems via synchronization.

problem Characterizing the dissipation features of quantum systems.
method Machine learning applied to a probing scheme with quantum synchronization.
result Machine learning significantly improves the inference of dissipation features from probe observables.

This work defines idealized SSL representations and improves existing methods.

problem Unclear characteristics of SSL representations leading to high downstream accuracies.
method Characterized ideal properties and derived necessary and sufficient conditions.
result Improved SSL methods and derived new objectives for contrastive and non-contrastive learning.

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.

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.

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.

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.

Interactive agent modeling by learning to probe improves understanding of other agents' behaviors.

problem Understanding and predicting the behaviors of other agents in interactive scenarios.
method An interactive agent modeling scheme enabled by encouraging the agent to learn to probe, combining imitation learning and curiosity-driven reinforcement learning.
result The agent model learned by the proposed approach generalizes better and enhances performance in multiple applications.

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.

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.

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 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 ↗

LP-FT improves personalized model training in FL by balancing generalization and personalization.

problem Federated Learning struggles with balancing global generalization and local personalization due to non-identical data distributions.
method Adapting Linear Probing followed by full Fine-Tuning (LP-FT) to the FL setting.
result LP-FT outperforms standard fine-tuning in balancing personalization and generalization across various datasets and PFT variants.

Sparse Canonical Correlation Analysis (CCA) has received considerable attention in high-dimensional data analysis to study the relationship between two sets of random variables. However, there has been remarkably little theoretical statistical foundation on sparse CCA in high-dimensional settings despite active methodo…

2013-11-24abs ↗pdf ↗

New method classifies reticulocytes from red blood cells without labels.

problem Classifying reticulocytes from mature red blood cells without fluorescent labels.
method Unsupervised machine learning on morpho-rheological markers.
result Promising results in classifying reticulocytes from mature red blood cells.

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.

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.

The search of unconventional magnetic and nonmagnetic states is a major topic in the study of frustrated magnetism. Canonical examples of those states include various spin liquids and spin nematics. However, discerning their existence and the correct characterization is usually challenging. Here we introduce a machine-…

2018-04-23abs ↗pdf ↗

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 ↗

Study reveals biases and generalization patterns in deep image models.

problem Understanding the inductive bias of deep generative models in high dimensions.
method Proposed a framework to empirically investigate bias and generalization using designed training datasets.
result Identified similarities to human psychology in model behavior and patterns.

PROBE algorithm efficiently solves sparse high-dimensional linear regression.

problem Sparse high-dimensional linear regression models with complex parameter spaces.
method Partitioned empirical Bayes ECM algorithm for computationally efficient MAP estimation.
result PROBE algorithm provides robust and efficient coordinate-wise optimization.

This work analyzes the role of data augmentation in self-supervised learning using RKHS approximation and regression.

problem Limited theoretical understanding of the role of data augmentation in self-supervised learning.
method Geometric characterization of the target function given by augmentation, proving generalization bounds.
result Two generalization bounds are derived, one free of model complexity, the other specific to near-optimal encoders.

Concept Hierarchies and Formal Concept Analysis are theoretically well grounded and largely experimented methods. They rely on line diagrams called Galois lattices for visualizing and analysing object-attribute sets. Galois lattices are visually seducing and conceptually rich for experts. However they present important…

2013-03-11abs ↗pdf ↗

New method predicts aphasia severity with narrower uncertainty intervals.

problem Predicting aphasia severity in stroke patients using neuroimages.
method Sparse heteroscedastic Bayesian high-dimensional regression with H-PROBE algorithm.
result H-PROBE provides narrower prediction intervals for aphasia severity.

Researchers propose a new SSL risk decomposition method to evaluate and improve self-supervised learning models.

problem Self-supervised learning evaluation is limited to a single metric, providing little insight into model performance and improvement.
method Proposes an SSL risk decomposition that considers four error components: approximation, representation usability, probe generalization, and encoder generalization.
result Analysis of 169 SSL vision models reveals the main sources of error and provides insights for improving SSL models in specific settings.

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 ↗

PROBE optimizes best-arm identification with cheap proxies, improving sample complexity.

problem Fixed-confidence best-arm identification with costly rewards and correlated cheap proxies.
method PROBE uses control-variate adjustment and phase elimination to learn residual variance online.
result PROBE achieves oracle sample complexity up to a constant factor and additive calibration cost.