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

88176264352 · Jun 202019922001200920172026
48 results for Source Localization

TransNet improves community detection on target networks using privacy-preserved source networks.

problem Community detection on sensitive network data with privacy constraints.
method Spectral clustering framework leveraging locally distributed privacy-preserved auxiliary networks via randomized response and adaptive weighting.
result TransNet delivers strong gains in community detection across various privacy levels and heterogeneity patterns.

A new algorithm speeds up EEG source localization using 1\ell_1 regularization.

problem Challenging inverse problem in mapping EEG readings to brain activity.
method Formulated as a graphical generalized elastic net inverse problem, solved with a variable projected algorithm (VPAL).
result VPAL provides faster and more accurate EEG source localization compared to existing methods.

New method improves multi-fidelity Bayesian optimization by accounting for local correlations and varying noise.

problem Existing multi-fidelity Bayesian optimization methods assume global correlation and constant noise, which limits performance.
method Proposes an MF emulation method that learns noise models for each data source and leverages locally correlated LF sources.
result Improves performance of multi-fidelity Bayesian optimization by accounting for local correlations and varying noise.

TopoGeoScore selects robust checkpoints using only source-domain representations.

problem Selecting robust checkpoints without target-domain labels or samples.
method Constructs class-conditional mutual k-nearest-neighbour graphs and extracts three interpretable signals.
result Source representations contain measurable global-local-topological evidence of robustness.

Magnetoencephalography and electroencephalography (M/EEG) are non-invasive modalities that measure the weak electromagnetic fields generated by neural activity. Estimating the location and magnitude of the current sources that generated these electromagnetic fields is a challenging ill-posed regression problem known as…

2019-10-03abs ↗pdf ↗

StrTransformer recovers sources without labels by optimizing latent matrices and enforcing structural constraints.

problem Unsupervised blind source recovery in signal processing.
method Source-wise structured Transformer framework with latent source matrix optimization, structural regularization, and branch-specific weights.
result StrTransformer learns distinct temporal-scale structures and recovers source-aligned latent trajectories.

The paper tackles personalized policy learning from diverse data sources in a federated setting.

problem Learning personalized decision policies from observational bandit feedback across multiple heterogeneous data sources.
method Introduces a novel regret analysis for distinguishing global and local regret, and presents a federated policy learning algorithm using local policies trained with doubly robust offline policy evaluation strategies.
result Establishes finite-sample upper bounds on global and local regret, characterizing them by source heterogeneity and distribution shift.

In this paper we propose a domain adaptation algorithm designed for graph domains. Given a source graph with many labeled nodes and a target graph with few or no labeled nodes, we aim to estimate the target labels by making use of the similarity between the characteristics of the variation of the label functions on the…

2019-11-07abs ↗pdf ↗

Localized transfer learning improves nonparametric regression performance.

problem Improving nonparametric regression performance on target tasks.
method Localized transfer learning framework that models heterogeneity and partition covariate space into cells.
result Sharp minimax rates show local transfer mitigates the curse of dimensionality.

Constructs initial data for Einstein vacuum equations involving multiple localized gravitational sources.

problem Modeling the interaction of distant gravitational systems in general relativity.
method Time-symmetric initial data construction using gluing schemes and localized sources.
result Produces initial data sets with finite ADM mass and multiple Einstein-Rosen bridges.

The study identifies two sources of invariants in 2--nondegenerate CR geometries.

problem Characterizing fundamental invariants of 2--nondegenerate CR geometries.
method Analyzes the harmonic curvature and the difference in complex structures.
result Nontrivial examples of CR geometries can be obtained as deformations of models.

FSL-Net detects and localizes feature shifts in large, high-dimensional datasets.

problem Feature shifts between data sources lead to erroneous features in various applications.
method FSL-Net is a neural network trained on multiple datasets to localize feature shifts.
result FSL-Net accurately localizes feature shifts from unseen datasets without re-training.

Study first-order locally convex Lie algebroids in Bastiani calculus.

problem Define and study first-order locally convex Lie algebroids.
method Define sheaves of Lie algebroid forms and morphisms, prove category structure, study representations and cohomology.
result First-order locally convex Lie algebroids form a category and have applications in Lie II theorems.

CAGES optimizes expensive RL problems by efficiently learning gradients from multiple sources.

problem Optimizing expensive-to-evaluate functions in high-dimensional spaces.
method Cost-Aware Gradient Entropy Search (CAGES) for multi-fidelity Bayesian optimization.
result Significant performance improvements on synthetic and RL benchmark problems.

Self-taught learning is a technique that uses a large number of unlabeled data as source samples to improve the task performance on target samples. Compared with other transfer learning techniques, self-taught learning can be applied to a broader set of scenarios due to the loose restrictions on the source data. Howeve…

2018-08-05abs ↗pdf ↗

In this paper, we take a new approach for time of arrival geo-localization. We show that the main sources of error in metropolitan areas are due to environmental imperfections that bias our solutions, and that we can rely on a probabilistic model to learn and compensate for them. The resulting localization error is val…

2019-10-15abs ↗pdf ↗

Fine-tuned open-source LLMs match or exceed closed-source models in social science research.

problem Limited scalability and high costs of large LLMs in social science research.
method Fine-tuning open-source models for specific tasks, exploring training set size effects, proposing hybrid workflow.
result Small, fine-tuned open-source LLMs achieve equal or superior performance to commercial alternatives.

A new method for drone-based geo-localization using style and spatial alignment.

problem Geo-localization of drone-view images with satellite-view images using pre-annotated GPS tags.
method Orientation-based method to align patterns, new branch to extract aligned partial features, style alignment strategy.
result The proposed method outperforms state-of-the-art alternatives in geo-localization accuracy.

TL-ANDI distills context from source data to improve transfer learning for TFMs.

problem Limited transfer learning due to context-size constraints and distribution shifts.
method TL-ANDI uses posterior-aware distillation to construct a compact source context and locally distills labels.
result Improves transfer performance by addressing context-size and distribution shifts.

Unsupervised domain adaptation methods aim to alleviate performance degradation caused by domain-shift by learning domain-invariant representations. Existing deep domain adaptation methods focus on holistic feature alignment by matching source and target holistic feature distributions, without considering local feature…

2018-11-12abs ↗pdf ↗

Researchers solve a nonlocal parabolic equation on manifolds using source-to-solution maps.

problem Determine Riemannian manifolds up to isometry using local source-to-solution maps.
method Comprehensive spectrum analysis and semigroup theory for nonlocal parabolic operators.
result Can determine Riemannian manifold up to isometry using local source-to-solution maps in a small open cylinder.

Independent component analysis (ICA) is the most popular method for blind source separation (BSS) with a diverse set of applications, such as biomedical signal processing, video and image analysis, and communications. Maximum likelihood (ML), an optimal theoretical framework for ICA, requires knowledge of the true unde…

2016-10-22abs ↗pdf ↗

Let GM\mathcal{G} \rightrightarrows M be a source locally trivial proper Lie groupoid such that each orbit is of finite type. The orbit projection MM/GM \to M/\mathcal{G} is a fibration if and only if GM\mathcal{G} \rightrightarrows M is regular.

2007-12-05abs ↗pdf ↗

We consider the problem of locating a point-source heart arrhythmia using data from a standard diagnostic procedure, where a reference catheter is placed in the heart, and arrival times from a second diagnostic catheter are recorded as the diagnostic catheter moves around within the heart. We model this situation as a …

2018-07-09abs ↗pdf ↗

Researchers can retrieve Yang-Mills-Higgs fields from Minkowski space measurements.

problem Retrieving Yang-Mills-Higgs fields from active local measurements in Minkowski space.
method Exploiting non-linear wave interactions and Lie algebra structure.
result Yang-Mills-Higgs fields can be retrieved from source-to-solution data.

CoinTossX is a low-latency, open-source matching engine for financial trading.

problem Efficiently matching orders in financial markets with low latency and high throughput.
method Developed in Java, orders submitted via UDP SBE, low-latency message transport (Aeron Media Driver). Separates order generation and matching.
result Demonstrated low-latency, high-throughput performance in various deployment scenarios.

Bayesian method improves EEG source localization and estimates skull conductivity.

problem Improving EEG source localization accuracy with unknown skull conductivity.
method Bayesian Approximation Error approach using conditional Gaussian regression, iterative optimization, and physics-informed learning.
result Clear improvements in EEG source localization accuracy and feasible estimates for unknown skull conductivity.

New algorithm identifies causal effects in latent confounding models.

problem Identifying causal effects in linear non-Gaussian models with latent confounding.
method Recursive algorithm using rank conditions on higher-order cumulants.
result Algorithm achieves comparable performance to overcomplete ICA without knowing the number of latent variables.