New method uses fractional posteriors for semiparametric inference with improved uncertainty quantification.
problem Semiparametric inference with nonparametric priors and fractional posteriors.
method Established a general Bernstein--von Mises theorem for fractional posterior distributions, proposed shifted-and-rescaled credible sets.
result Fractional posterior credible sets provide reliable uncertainty quantification but have inflated size; shifted-and-rescaled set is an efficient confidence set.
Study improves fractional posterior for 1-bit matrix completion.
problem Estimating a binary matrix from observed entries.
method Fractional posterior approach with low-rank factorization and spectral scaled Student priors.
result Concentration results for fractional posterior, demonstrating effectiveness in matrix recovery.
Improved Thompson Sampling using fractional posteriors achieves better regret bounds.
problem Optimizing regret in stochastic multi-armed bandit problems.
method Using α-posterior distributions, derived frequentist regret bounds. result Instance-dependent and instance-independent regret bounds established.
Unified analysis of Gaussian Process Thompson Sampling without discretization.
problem Sequential decision-making over continuous action spaces.
method Frequentist regret analysis based on fractional Gaussian process posteriors.
result Unified discretization-free regret bound for various kernel classes.
Adversarial inference on tree models is possible with limited corruption, improving on Kesten-Stigum threshold.
problem Posterior inference on tree-structured graphical models in the presence of adversarial corruption.
method Dynamic programming via belief propagation, constrained adversarial corruption.
result Belief propagation can perform accurate inference with limited adversarial corruption.
We develop a variational framework for SDEs driven by fractional noise.
problem Capturing long-term dependencies in SDEs driven by fractional noise.
method Markov approximation of fractional Brownian motion, variational inference, neural networks.
result Efficient variational inference of posterior path measures for neural-SDEs.
The paper analyzes sparse high-dimensional linear regression with random design and unknown error variance, providing adaptiveness and concentration rates.
problem Sparse high-dimensional linear regression with random design and unknown error variance.
method Analysis of posterior concentration rates, employing techniques to address model misspecification.
result Adaptiveness and concentration rates of the posterior for sparse high-dimensional linear regression.
New method efficiently samples Gaussian process posteriors without cubic scaling.
problem Intractable posterior distributions in Gaussian processes.
method Decomposes Gaussian processes into prior and data components for scalable sampling.
result Fast posterior sampling at a fraction of the usual cost.
A new method selects optimal temperature for Bayesian Deep Learning.
problem Finding the optimal temperature for improving predictive performance in Bayesian Deep Learning.
method Data-driven approach to estimate temperature as a model parameter.
result Our method performs comparably to grid search but at a fraction of the cost.
SGLDiff approximates Bayesian posterior distributions with subsampling error.
problem Approximating Bayesian posterior distributions in large-scale data settings.
method Stochastic Gradient Langevin Diffusion (SGLDiff) with subsampling.
result The Wasserstein distance between the posterior and SGLDiff's limiting distribution is bounded by a fractional power of the mean waiting time.
Simulation-free VI closes the approximation gap in latent SDEs
problem Recovering dynamical systems from noisy observations
method Helmholtz-SDE
result Recovers dynamics more faithfully than prior methods
A new method decouples set representation learning from posterior modeling for efficient amortized inference.
problem Efficient inference for large sets of observations with shared factors.
method Train a mean-pool Deep Set on sets of size at most two, then finetune the inference head on pre-aggregated embeddings.
result Matches or outperforms standard baselines at a fraction of the compute cost for large N.
Improves posterior approximation speed for Dirichlet process mixture models.
problem Inefficiency of stochastic variational inference in large datasets.
method Uses stochastic gradient ascent with adaptive stepsize optimization.
result Adaptive stepsize improves speed and performance of posterior approximation.
Bayesian model improves cure fraction estimation in survival analysis.
problem Estimating cure fraction in survival analysis.
method Hierarchical Bayesian framework for semiparametric mixture cure model.
result Improved accuracy in capturing unobserved heterogeneity.
Adaptive Langevin dynamics reduces bias in Bayesian inference with mini-batching.
problem Bias in posterior sampling due to mini-batching in Bayesian inference.
method Adaptive Langevin dynamics with dynamical friction to correct noise.
result Quantified bias in posterior distribution due to mini-batching.
We propose a generic Markov Chain Monte Carlo (MCMC) algorithm to speed up computations for datasets with many observations. A key feature of our approach is the use of the highly efficient difference estimator from the survey sampling literature to estimate the log-likelihood accurately using only a small fraction of …
In this paper, we propose PCKID, a novel, robust, kernel function for spectral clustering, specifically designed to handle incomplete data. By combining posterior distributions of Gaussian Mixture Models for incomplete data on different scales, we are able to learn a kernel for incomplete data that does not depend on a…
ADDA framework speeds up data augmentation in massive data settings.
problem Slow data augmentation in massive data settings.
method Develops asynchronous and distributed data augmentation (ADDA) framework.
result ADDA significantly speeds up data augmentation compared to parent DA algorithms.
A new knot selection method speeds up sparse Gaussian process approximations.
problem Efficiently selecting knots for sparse Gaussian processes.
method One-at-a-time Bayesian optimization for knot selection.
result Competitive performance with reduced computational cost.
We present an adaptive approach to the construction of Gaussian process surrogates for Bayesian inference with expensive-to-evaluate forward models. Our method relies on the fully Bayesian approach to training Gaussian process models and utilizes the expected improvement idea from Bayesian global optimization. We adapt…
We study the problem of robustly estimating the posterior distribution for the setting where observed data can be contaminated with potentially adversarial outliers. We propose Rob-ULA, a robust variant of the Unadjusted Langevin Algorithm (ULA), and provide a finite-sample analysis of its sampling distribution. In par…
Can we make Bayesian posterior MCMC sampling more efficient when faced with very large datasets? We argue that computing the likelihood for N datapoints in the Metropolis-Hastings (MH) test to reach a single binary decision is computationally inefficient. We introduce an approximate MH rule based on a sequential hypoth…
In this work we present a new approach on studying dynamical systems. Combining the two ways of expressing the uncertainty, using probabilistic theory and credibility theory, we have research the generalized fractional hybrid equations. We have introduced the concepts of generalized fractional Wiener process, generaliz…
Methods from the geometry of nonholonomic manifolds and Lagrange-Finsler spaces are applied in fractional calculus with Caputo derivatives and for elaborating models of fractional gravity and fractional Lagrange mechanics. The geometric data for such models are encoded into (fractional) bi-Hamiltonian structures and as…
Introduces fractional k-dimensional measure bridging fractional length and area.
problem Defining fractional measures for dimensions between 0 and n-1.
method Introduces a parameterized fractional measure σ that converges to Hausdorff measure. result Fractional measure converges to Hausdorff measure with a known constant factor.
The theory of derivative of noninteger order goes back to Leibniz, Liouville and Riemann. Derivatives of fractional order have found many applications in recent studies in mechanics, physics, economics. In this paper we define the fractional tangent bundle on a manifold, using a method of Radu Miron. The fractional Lei…
Let Sg be a closed orientable surface of genus g≥2 and C a simple closed nonseparating curve in F. Let tC denote a left handed Dehn twist about C. A \textit{fractional power} of tC of \textit{exponent} $\fraction{\ell}{n}$ is an $h \in \Mod(S_g)$ such that hn=tCℓ. Unlike a root of a $t…
We formulate the fractional Ricci flow theory for (pseudo) Riemannian geometries enabled with nonholonomic distributions defining fractional integro-differential structures, for non-integer dimensions. There are constructed fractional analogs of Perelman's functionals and derived the corresponding fractional evolution …
Using Caputo fractional derivative of order α we build the fractional jet bundle of order α and its main geometrical structures. Defined on that bundle, some fractional dynamical systems with applications to economics are studied.
Volatility roughness studied using fractional noise-driven models.
problem Volatility roughness interpretation.
method Data-reconstructed fractional volatility model with fractional noise.
result Option pricing equation and solution derived using Malliavin calculus.
Using the reviewed Riemann-Liouville fractional derivative we introduce the fractional osculator Lagrange space of k order and the main structures on it. The results are applied at the k order fractional prolongation of Lagrange, Finsler and Riemann fractional structures.
MFMs enable efficient reward alignment for generative models.
problem Computational bottleneck in controlling generative models.
method Meta Flow Maps (MFMs) extend consistency models and flow maps to stochastic regime for efficient value function estimation.
result MFMs enable inference-time steering and unbiased, off-policy fine-tuning to general rewards efficiently.
Develops fractional de Rham theory for Maxwell equations.
problem Formulating fractional calculus for Maxwell equations.
method Fractional tangent functionals, Riemann-Liouville integral, polynomial algebra, exterior algebra.
result Fractional de Rham complex for Maxwell equations.
Modeling financial markets with memory using fractional calculus and Brownian motion.
problem Capturing memory effects in financial markets using stochastic models.
method Fractional Langevin equation with colored noise generated by fractional Brownian motion.
result Anomalous marginal glass phase observed in some regions of the system.
Long and short memory in economic processes is usually described by the so-called discrete fractional differencing and fractional integration. We prove that the discrete fractional differencing and integration are the Grunwald-Letnikov fractional differences of non-integer order d. Equations of ARIMA(p,d,q) and ARFIMA(…
In this paper we established the condition for a curve to satisfy stochas- tic fractional HP (Hamilton-Pontryagin) equations. These equations are described using It^o integral. We have also considered the case of stochastic fractional Hamiltonian equa- tions, for a hyperregular Lagrange function. From the stochastic fr…
We study the fractional gravity for spacetimes with non-integer dimensions. Our constructions are based on a geometric formalism with the fractional Caputo derivative and integral calculus adapted to nonolonomic distributions. This allows us to define a fractional spacetime geometry with fundamental geometric/physical …
Extends fractional Lp uncertainty principles with extremizers and stability results.
problem Investigating uncertainty principles in fractional Lp settings. method Analyzing the fractional Schrödinger equation to find extremal functions and sharp constants.
result Proves stability of extremizers for fractional uncertainty inequalities.
Approximates derivative pricing under fractional stochastic volatility.
problem Derivative pricing under fractional stochastic volatility model.
method Approximate expression derived from deterministic functions and fractional Ornstein-Uhlenbeck process.
result Numerical simulations show the feasibility and effect of long-range dependencies on derivative prices.
Improves probability distribution compression with KT algorithm.
problem Efficiently compressing probability distributions.
method Kernel thinning (KT) algorithm with four improvements.
result KT yields tighter, dimension-free guarantees for any kernel.
In this paper we introduce a link between geometry of ordinary continued fractions and trajectories of points that moves according to the second Kepler law. We expand geometric interpretation of ordinary continued fractions to the case of continued fractions with arbitrary elements.
The paper studies inequalities for fractional GJMS operators on conformal infinity.
problem Deriving comparison inequalities for fractional Yamabe constants.
method Using Poincaré-Einstein manifolds and fractional GJMS operators.
result Two comparison inequalities for fractional Yamabe constants are derived.
Using the fractional integration and differentiation on R we build the fractional jet fibre bundle on a differentiable manifold and we emphasize some important geometrical objects. Euler-Lagrange fractional equations are described. Some significant examples from mechanics and economics are presented.
Bayesian inference is a popular method to build learning algorithms but it is hampered by the fact that its key object, the posterior probability distribution, is often uncomputable. Expectation Propagation (EP) (Minka (2001)) is a popular algorithm that solves this issue by computing a parametric approximation (e.g: G…
New model uses generalized fractional Brownian motion for stock price prediction.
problem Traditional models fail to accurately predict stock price fluctuations.
method Introduces generalized fractional Brownian motion as a new stochastic process for price modeling.
result Validates the new model for option pricing and risk assessment.
Paper approximates fractional harmonic maps with numerical methods.
problem Approximating fractional harmonic maps with constraints and nonlocality.
method Weak compactness results and numerical methods for various PDEs.
result Convergence of numerical approximations for fractional harmonic maps.
New framework for ranking distributions using variable fractional parameters.
problem Ordering distributions with varying steepness and local non-concavities.
method Introducing a function γ:Ro[0,1] to replace the fixed parameter in fractional SD. result Enables ranking of a broader range of distributions and incorporates dynamic greediness.
The mixed-fractional CEV model improves CDS pricing by accounting for default risk.
problem Improving the pricing of Credit Default Swaps (CDS) by accounting for default risk.
method Using a mixed-fractional Brownian motion to model the Constant Elasticity of Variance (CEV) model.
result The mixed-fractional CEV model yields more realistic CDS spreads and default probabilities.