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

4488131175 · May 202619922001200920172026
48 results for Bohmian Mechanics

Quantum model captures rare financial events not seen by Gaussian statistics.

problem Underestimation of rare financial events by Gaussian statistics.
method Quantum Bohmian Mechanics applied to multifractal random walk (MRW) models.
result Rare financial events generate a potential barrier in quantum potentials.

A solution for the Weinstein's Problem in the general framework of generalized Lie algebroids is the target of this paper. We present the mechanical systems called by use, mechanical (?; ?)-systems, Lagrange mechanical (?; ?)-systems or Finsler mechanical (?; ?)-systems and we develop their geometries. We obtain the ca…

2011-08-14abs ↗pdf ↗

A new description, different by the classical theory of Hamiltonian Mechanics, in the general framework of generalized Lie algebroids is presented. In the particular case of Lie algebroids, new and important results are obtained. We present the \emph{dual mechanical systems} called by use, \emph{dual mechanical}$(ρ,η) …

2011-08-25abs ↗pdf ↗

This paper assesses Gaussian and Exponential mechanisms for certifying adversarial robustness.

problem Certifying adversarial robustness using randomized smoothing mechanisms.
method Proposes a generic framework to assess the appropriateness of randomized smoothing mechanisms.
result Gaussian mechanism is an appropriate option for certifying both 2\ell_2-norm and \ell_\infty-norm robustness.

Differential privacy mechanism design has traditionally been tailored for a scalar-valued query function. Although many mechanisms such as the Laplace and Gaussian mechanisms can be extended to a matrix-valued query function by adding i.i.d. noise to each element of the matrix, this method is often suboptimal as it for…

2018-01-02abs ↗pdf ↗

Expands differential privacy mechanisms to include the Generalized Gaussian mechanism for improved private machine learning.

problem Improving privacy in machine learning algorithms while maintaining utility.
method Introduces and analyzes the Generalized Gaussian (GG) mechanism for differential privacy.
result The GG mechanism provides better performance than the Laplace and Gaussian mechanisms across various values of β.

Optimal DP mechanisms for vector queries are found to be staircase distributions.

problem Designing optimal additive mechanisms for vector-valued queries under differential privacy.
method Reduction to radially symmetric distributions and convex rearrangement theory.
result Staircase mechanisms are optimal for any norm and cost function.

New approach identifies latent properties from mechanisms, not just data.

problem Identifying latent properties from data generating processes.
method Equivariance perspective on identifiable representation learning.
result Identification of latent properties is possible up to shared equivariances in known mechanisms.

New RL approach learns dynamic VCG mechanisms in unknown MDP environments.

problem Learning dynamic VCG mechanisms in unknown MDP environments.
method Reward-free online RL for exploration, combined with function approximation.
result Regret bound of O~(T2/3)\tilde{\mathcal{O}}(T^{2/3}) for dynamic VCG mechanism learning.

A new Gaussian mechanism for differential privacy in the shuffle model is introduced.

problem Improving differential privacy in distributed learning environments.
method Characterization and upper-bounding of Rényi differential privacy (RDP) for the shuffle Gaussian mechanism.
result The shuffle Gaussian mechanism provides improved privacy guarantees compared to existing methods.

We study the problem of what causes prices to change. We define the mechanical impact of a trading order as the change in future prices in the absence of any future changes in decision making, and its it informational impact as the remainder of the total impact once mechanical impact is removed. We introduce a method o…

2006-08-27abs ↗pdf ↗

New mechanism for pure differential privacy on functional summaries using Laplace-like process.

problem Challenges in achieving differential privacy for complex, structured functional summaries.
method Independent Component Laplace Process (ICLP) mechanism for infinite-dimensional Hilbert space.
result Effective enhancement of utility of private summaries through oversmoothing.

Unified framework for subsampling mechanisms with tighter privacy guarantees.

problem Improving privacy in machine learning models through subsampling.
method Conditional optimal transport for deriving mechanism-specific subsampling guarantees.
result Tighter privacy bounds for subsampled mechanisms compared to traditional methods.

This text explains how fiber bundle structure is fundamental for classical physics.

problem None explicitly stated, but implied as understanding fiber bundles is crucial for physics.
method Explains the fiber bundle structure and its universality for physics laws.
result Fiber bundle structure is fundamental for classical physics laws.

The paper improves privacy accounting for discrete-valued mechanisms and the subsampled Gaussian mechanism.

problem Improving the accuracy and efficiency of differential privacy accounting for discrete outputs.
method Uses fast Fourier transform (FFT) for rigorous error analysis and accounting of privacy loss.
result Provides strict lower and upper bounds for (ε,δ)(\varepsilon,δ)-values, demonstrating up to 75% reduction in noise variance.

This paper examines allocation mechanisms in markets with transfer costs, showing how these costs affect economic efficiency.

problem Transfer costs in decentralized exchange markets reduce economic efficiency.
method An axiomatic study of allocation mechanisms in the presence of transfer costs, providing robust and conditional mean allocation mechanisms.
result Robust and conditional mean allocation mechanisms are identified, relating to risk sharing in agent pools.

CICME estimates common and domain-specific causal mechanisms from multi-sensor data.

problem Inferring causal mechanisms from heterogeneous multi-sensor data across multiple domains.
method Three-step approach using Causal Transfer Learning (CTL).
result CICME reliably detects domain-invariant causal mechanisms and guides individual domain causal mechanism estimation.

Many modern databases include personal and sensitive correlated data, such as private information on users connected together in a social network, and measurements of physical activity of single subjects across time. However, differential privacy, the current gold standard in data privacy, does not adequately address p…

2016-03-13abs ↗pdf ↗

This work uses statistical mechanics to explain AI learning.

problem Understanding the statistical principles behind AI learning.
method Starting from sample concentration behaviors, the study applies statistical mechanics principles to AI and machine learning.
result Exponential families and statistical quantities are key in AI and machine learning.

Mechanism designs for unknown agent values in stochastic bandit settings.

problem Designing truthful mechanisms for maximizing social welfare in settings with unknown agent values and stochastic feedback.
method Developed a VCG-like mechanism with regret bounds for multi-round allocations, balancing agent and seller welfare.
result Achieved an $Ω(T^{ rac{2}{3}})$ lower bound for the maximum of welfare, agent utilities, and mechanism utility after TT rounds.

The Dirichlet mechanism protects privacy while minimizing KL divergence.

problem Minimizing KL divergence while protecting sensitive data privacy.
method Using the exponential mechanism with the KL divergence loss function, resulting in the Dirichlet mechanism.
result Proved a probability tail bound on KL divergence and derived a lower bound for sample complexity.

Paper tackles dynamic behavior of variable topology mechanisms, presenting new transition conditions.

problem Dynamic behavior of mechanisms with changing kinematic topology.
method Presented new transition conditions for variable topology mechanisms using projected motion equations and Voronets equations.
result Results show the dynamic behavior of joint locking in 3R and 6DOF mechanisms.

Study investigates OOD generalization methods for mechanics problems.

problem Real-world mechanics problems with unknown test environments and data distribution shifts.
method Investigates OOD generalization methods for regression problems in mechanics.
result OOD generalization methods perform better than traditional ML methods on mechanics-specific regression problems.

Proposes a new method for estimating counterfactual treatment effects.

problem Uncertainty in identifying causal mechanisms from observational data.
method Introduces a parameterized family of causal mechanisms that generalize Gumbel-max, trained to minimize counterfactual effect variance.
result Trained mechanisms yield lower variance estimates of counterfactual treatment effects.

Mechanism design for large item sets using topic models.

problem Designing optimal mechanisms for large item sets when exact priors are unknown or intractable.
method Proposes a framework that disentangles statistical estimation and mechanism design, leveraging topic models to reduce complexity.
result Reduces the complexity of mechanism design for large item sets, making it feasible with topic models.

In some previous papers, a Legendre duality between Lagrangian and Hamiltonian Mechanics has been developed. The (ρ,η)-tangent application of the Legendre bundle morphism associated to a Lagrangian L or Hamiltonian H is presented. Using that, a Legendre description of Lagrangian Mechanics and Hamiltonian Mechanics is d…

2011-08-29abs ↗pdf ↗

The paper explores invariant subbundles in nonholonomic mechanics.

problem Determining invariant affine subbundles in nonholonomic and constrained variational mechanics.
method Using Spencer cohomology and iterative formulae, the paper formalizes the integrability of linear partial differential equations and determines the largest invariant affine subbundle.
result Iterative formulae for determining the largest invariant affine subbundle are provided.