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

295988117 · Jun 202019922001200920172026
48 results for Probabilistic Shielding

We present an elementary argument that one can shield linearised gravitational fields using linearised gravitational fields. This is done by using third-order potentials for the metric, which avoids the need to solve singular equations in shielding or gluing constructions for the linearised metric.

2017-01-02abs ↗pdf ↗

Model analyzes debt recycling strategies under various fiscal regimes and jurisdictions.

problem Understanding debt recycling dynamics and their impact on repayment times and equity growth.
method Developed a calibrated model incorporating mortgage interest rates, borrowing costs, and tax shields.
result Introducing positive interest rates without tax shields contracts success regions and lengthens repayment times, but tax shields partially reverse these effects.

Proves positive mass theorem for spin initial data sets with arbitrary ends and dominant energy shields.

problem Proving the positive mass theorem for spin initial data sets with various ends and energy shields.
method Modification of Witten's approach involving an additional independent timelike direction in the spinor bundle.
result Positive mass theorem for spin initial data sets with arbitrary ends and dominant energy shields.

In this appraisal paper, we evaluate the efficacy of SHIELD, a compression-based defense framework for countering adversarial attacks on image classification models, which was published at KDD 2018. Here, we consider alternative threat models not studied in the original work, where we assume that an adaptive adversary …

2019-02-01abs ↗pdf ↗

Extends positive mass theorem to arbitrary dimensions using a new inductive scheme.

problem Overcoming singularities in the Schoen-Yau proof for arbitrary dimensions.
method Inductive scheme combining shielding principle, conformal blow-up, and Cheeger-Naber bound.
result Proof of positive mass theorem in arbitrary dimensions.

Defense strategy improves controller robustness against adversarial attacks.

problem Adversarial attacks on learning-enabled controllers in CPS.
method Two-stage defense strategy treating controller and environment as black-boxes with unknown dynamics.
result Defense strategy effectively improves controller robustness in realistic control domains.

Paper discusses quasilocal mass and fill-ins, proving positivity and exploring definitions.

problem Exploring and defining quasilocal mass and fill-ins in general relativity.
method Analyzes several proposals of quasilocal mass based on Hamiltonian formulation and proves positivity under certain conditions.
result Positivity of Wang-Yau energy under a more general condition.

Graph neural networks predict solid-state NMR parameters from atomic structures.

problem Efficiently predicting NMR parameters from atomic structures for complex materials.
method Graph neural networks applied to tensor quantities for anisotropic magnetic shielding and electric field gradient.
result Improved accuracy in predicting NMR properties from diverse and complex materials.

Proves spacetime positive mass theorem for spin initial data sets with arbitrary ends.

problem Proving the spacetime positive mass theorem for specific spacetime configurations.
method Solving a mixed boundary value problem for the Dirac-Witten operator with a Callias potential.
result Established spacetime positive mass theorem for asymptotically flat spin initial data sets with arbitrary ends.

We perform an optimal localization of asymptotically flat initial data sets and construct data that have positive ADM mass but are exactly trivial outside a cone of arbitrarily small aperture. The gluing scheme that we develop allows to produce a new class of NN-body solutions for the Einstein equation, which patently…

2014-07-17abs ↗pdf ↗

We show how to parameterise solutions of the general relativistic vector constraint equation on Einstein manifolds by unconstrained potentials. We provide a similar construction for the trace-free part of tensors satisfying the linearised scalar constraint. Previous work of ours has provided similar different construct…

2020-02-04abs ↗pdf ↗

Flow taxes and stock taxes preserve portfolio neutrality under specific conditions.

problem Analyzing the impact of different types of taxes on portfolio choice.
method Extending the neutrality result to a full system of ownership taxes, showing how each tax modifies the drift of the wealth process.
result The combined system of taxes preserves portfolio neutrality under three conditions, and the drift-shift symmetry generalizes to a drift-shift-and-rescale symmetry.

This work introduces benchmarks for evaluating nanophotonic structures in design simulations.

problem Design and understanding of nanophotonic structures for various applications.
method Development of frameworks and benchmarks for evaluating nanophotonic structures in parametric design problems.
result Strategic use of evaluation fidelity in enhancing structure designs.

The paper establishes distance estimates for manifolds with lower scalar curvature bounds.

problem Distance estimates on manifolds with lower scalar curvature bounds.
method Introduced a definition of relative index via a deformed Dirac operator trick and proved index coincidence with Callias operators.
result Proved short neck inequality and quantitative shielding result with positive scalar curvature.

Study identifies key parameters and input dimensions making LLMs and VLMs brittle.

problem Vulnerability of large language and vision-language models to perturbations.
method Proposed FI measure based on information geometry to quantify sensitivity.
result Small subset of high FI parameters significantly contribute to brittleness.

Pari-mutuel markets are trading platforms through which the common market maker simultaneously clears multiple contingent claims markets. This market has several distinctive properties that began attracting the attention of the financial industry in the 2000s. For example, the platform aggregates liquidity from the ind…

2015-09-23abs ↗pdf ↗

Privacy-preserving crypto exchanges adjust prices based on Gaussian noise.

problem Ensuring fair pricing in privacy-preserving cryptocurrency exchanges.
method Derive Kyle equilibrium with Gaussian noise perturbation, rescaling price-impact and strategy factors.
result Identify a privacy subsidy as a transfer from LP pool to traders, invariant to noise.

GraphShield uses dynamic graph learning to detect and visualize financial risks.

problem Detecting and mitigating risks in financial networks.
method Enhanced Cross-Domain Information Learning, Advanced Risk Recognition, Risk Propagation Visualization.
result GraphShield effectively identifies and visualizes hidden financial risks.

CLEANN detects and mitigates neural network Trojans without labeled data.

problem Trojans in embedded neural networks that bypass detection during inference.
method Dictionary learning and sparse approximation for identifying Trojan triggers, lightweight algorithm/hardware co-design.
result Efficient real-time execution on resource-constrained platforms, competitive attack resiliency.

Deep Learning has established itself to be a common occurrence in the business lexicon. The unprecedented success of deep learning in recent years can be attributed to: abundance of data, availability of gargantuan compute capabilities offered by GPUs, and adoption of open-source philosophy by the researchers and indus…

2019-09-30abs ↗pdf ↗

Develops privacy-preserving methods for longitudinal linear regression.

problem Protecting individual information in longitudinal data with privacy-preserving statistics.
method Proposes a user-level private regression estimator and a privatized covariance estimator for longitudinal linear regression under user-level differential privacy.
result Establishes theoretical guarantees for practical user-level differential privacy estimation and inference in longitudinal linear regression.

Probabilistic deep learning uses neural networks and models to handle uncertainty.

problem Handling uncertainty in deep learning models.
method Two approaches: probabilistic neural networks and deep probabilistic models.
result TensorFlow Probability library supports both approaches.

TIP-Search optimizes market prediction accuracy and timeliness under uncertain load.

problem Real-time market prediction requires accurate predictions before a deadline.
method Filters feasible models, dispatches workers, trades accuracy for deadline risk.
result Optimized pool achieves 0.991 timely accuracy and 0.994 raw accuracy.

We introduce the notion of a stochastic probabilistic program and present a reference implementation of a probabilistic programming facility supporting specification of stochastic probabilistic programs and inference in them. Stochastic probabilistic programs allow straightforward specification and efficient inference …

2020-01-08abs ↗pdf ↗

Recent advances in statistical inference have significantly expanded the toolbox of probabilistic modeling. Historically, probabilistic modeling has been constrained to (i) very restricted model classes where exact or approximate probabilistic inference were feasible, and (ii) small or medium-sized data sets which fit …

2019-08-09abs ↗pdf ↗

We propose design guidelines for a probabilistic programming facility suitable for deployment as a part of a production software system. As a reference implementation, we introduce Infergo, a probabilistic programming facility for Go, a modern programming language of choice for server-side software development. We argu…

2019-06-20abs ↗pdf ↗

Probabilistic programming allows specification of probabilistic models in a declarative manner. Recently, several new software systems and languages for probabilistic programming have been developed on the basis of newly developed and improved methods for approximate inference in probabilistic models. In this contribut…

2013-06-02abs ↗pdf ↗

We present a new algorithm for approximate inference in probabilistic programs, based on a stochastic gradient for variational programs. This method is efficient without restrictions on the probabilistic program; it is particularly practical for distributions which are not analytically tractable, including highly struc…

2013-01-07abs ↗pdf ↗

Forward inference techniques such as sequential Monte Carlo and particle Markov chain Monte Carlo for probabilistic programming can be implemented in any programming language by creative use of standardized operating system functionality including processes, forking, mutexes, and shared memory. Exploiting this we have …

2014-03-03abs ↗pdf ↗

The paper extends calibration to sets of probabilistic classifiers, finding many ensembles are poorly calibrated.

problem Evaluating the validity of epistemic uncertainty in sets of probabilistic classifiers.
method Proposed a novel nonparametric calibration test for sets of probabilistic classifiers.
result Ensembles of deep neural networks are often not well calibrated.