We develop a maximum penalized quasi-likelihood estimator for estimating in a nonparametric way the diffusion function of a diffusion process, as an alternative to more traditional kernel-based estimators. After developing a numerical scheme for computing the maximizer of the penalized maximum quasi-likelihood function…
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,181 papers · 148 categories
Trend · papers per month
48 results for “Maximum Quasi-Likelihood”
This paper optimizes subsampling for large datasets using Poisson distribution.
problem Efficiently subsample large datasets for quasi-likelihood estimation.
method Derives optimal Poisson subsampling probabilities and develops a distributed subsampling framework.
result Consistent and asymptotically normal estimators are obtained.
A new method for training diffusion models using likelihood matching.
problem Training efficient and accurate diffusion models.
method Likelihood Matching approach, quasi-likelihood approximation, score and Hessian estimation.
result Consistent matching of first two transitional moments between diffusion steps.
The article explains how to use Mixture-of-Experts models for complex data.
problem Modeling complex data generating processes (DGPs).
method Constructing Mixture-of-Experts (MoE) models using maximum quasi-likelihood (MQL) estimators and blockwise-MM algorithms.
result MQL estimators are consistent and asymptotically normal under certain conditions.
Quasi-likelihood analysis for marked point processes and application to marked Hawkes processesmath.ST
Develops quasi-likelihood analysis for marked point processes and applies it to Hawkes processes.
problem Analyzing multivariate marked point processes and their applications.
method Quasi-likelihood analysis for a general class of multivariate marked point processes, with focus on marked Hawkes processes.
result The quasi-likelihood analysis for marked Hawkes processes provides explicit conditions for ergodicity and Markovian transformation.
This study tackles Gaussian process regression with summarized data.
problem Learning and inference with summarized data (summary statistics, counts) in spatial modeling.
method Sample quasi-likelihood approach to Gaussian process regression.
result Approximation performance of the method is influenced by data granularity and covariance function length scale.
A test for neural networks identifies genetic associations.
problem Testing complex associations in neural networks.
method Sieve quasi-likelihood ratio test for neural networks with one hidden layer.
result The test statistic has an asymptotic chi-squared distribution.
Efficient Computation of the Quasi Likelihood function for Discretely Observed Diffusion Processesstat.CO
We introduce a simple method for nearly simultaneous computation of all moments needed for quasi maximum likelihood estimation of parameters in discretely observed stochastic differential equations commonly seen in finance. The method proposed in this papers is not restricted to any particular dynamics of the different…
New algorithms improve Bayesian linear regression with spike-and-slab priors.
problem Efficiently sampling from Bayesian linear regression models with sparsity-inducing priors.
method Design of two sampling algorithms: Gibbs sampling and Stochastic Localization.
result Stochastic Localization sampler shows significant advantage for poorly designed data matrices.
Bregman-divergence-guided Legendre exponential dispersion model with finite cumulants (K-LED)math.ST
A new model relaxes constraints on exponential dispersion models.
problem Tight conditions on cumulant function limit the class of exponential dispersion models.
method Introduces K-LED model with Legendre cumulant function and Bregman divergence guidance.
result The model allows for easier computation of mean parameter and includes various distributions.
The paper introduces a method for fitting complex models using simulation and optimization.
problem Fitting models with intractable likelihood or moments.
method Sequential sampling and local smoothing, combining global and local search phases.
result The proposed method outperforms alternative approaches in fitting complex models.
Graph Neural Networks for Forecasting Multivariate Realized Volatility with Spillover Effectsq-fin.ST
Graph neural networks improve volatility forecasting by capturing spillover effects.
problem Forecasting multivariate realized volatility with spillover effects.
method Customized graph neural networks incorporating spillover effects from multi-hop neighbors.
result Modeling nonlinear spillover effects enhances forecasting accuracy, especially for short-term horizons.
Selective inference for group lasso estimators across various distributions and covariates.
problem Developing selective inference methods for group lasso estimators.
method Randomized group-regularized optimization problem with post-selection likelihood.
result Selective point estimator and Wald-type confidence regions for regression parameters.
A new model forecasts financial risks using multiple realized measures.
problem Forecasting financial risks using multiple realized measures.
method Developed a semi-parametric joint VaR and ES forecasting framework using realized measures.
result The proposed model outperformed other models in forecasting financial risks.
New algorithm speeds up fitting GLLVMs to large datasets.
problem Efficiently fitting GLLVMs to large datasets with thousands of observations.
method Approximate model using penalized quasi-likelihood, then use Newton method and Fisher scoring.
result Significantly faster and more stable than previous methods, enabling fits to larger matrices.
Is Volatility Rough ?math.ST
New study finds actual volatility is rougher than previously thought.
problem Determining if volatility is rough based on log realized volatility data.
method Developed a quasi-likelihood estimator for fractional stochastic volatility model.
result Volatility is indeed rougher than previously estimated.
New model reduces volatility parameters and complexity.
problem Accurately modeling multivariate volatility with network structure.
method Introduces a new multivariate volatility model using both low and high-frequency data.
result The model significantly reduces parameter count and computational complexity.
A new method for non-negative matrix factorization using generalized dual divergence.
problem Non-negative matrix factorization for various noise structures.
method Theoretical framework based on generalized dual Kullback-Leibler divergence, with algorithms developed and proven convergence using Expectation-Maximization.
result Generalizes existing methods and provides an alternative for non-negative matrix factorizations.
Adaptive Pricing in Insurance: Generalized Linear Models and Gaussian Process Regression Approachesecon.EM
Adaptive pricing models for insurance using GLMs and GP regression.
problem Optimizing revenue from new insurance products.
method Developed two adaptive pricing models: GLM and Gaussian Process (GP) regression.
result The adaptive GLM and GP models reduce revenue loss compared to static pricing.
The model analyzes order flows in financial markets using Cox-type intensities.
problem Analyzing order dynamics in limit order books for market insights.
method Cox-type model for relative intensities, parameter estimation by quasi likelihood maximization, model selection with information criteria.
result The model provides excellent agreement with empirical data and identifies important factors in order book dynamics.
The paper introduces a new volatility model for state heterogeneous financial markets using high-frequency data.
problem State heterogeneity in financial volatility processes.
method Developed a state heterogeneous GARCH-Ito (SG-Ito) model based on continuous Ito diffusion process.
result Empirical studies reveal various state heterogeneities in S&P 500 index volatility.
This article studies local and global inference for smoothing spline estimation in a unified asymptotic framework. We first introduce a new technical tool called functional Bahadur representation, which significantly generalizes the traditional Bahadur representation in parametric models, that is, Bahadur [Ann. Inst. S…
A Bayesian Long Short-Term Memory Model for Value at Risk and Expected Shortfall Joint Forecastingstat.ML
Bayesian LSTM model improves VaR and ES forecasting accuracy.
problem Joint forecasting of Value at Risk (VaR) and Expected Shortfall (ES).
method Hybrid model combining LSTM for time series dynamics and Asymmetric Laplace quasi-likelihood for joint likelihood.
result The LSTM-AL model outperforms existing models in VaR and ES forecasting accuracy.
New method selects sparse predictors in large LMMs.
problem Sparse learning for LMMs is computationally infeasible for large datasets.
method Developed an regularized method with coordinate descent and local search algorithms.
result Method selects thousands of predictors in seconds to minutes.
Using quantile time series and historical simulation to forecast financial risk multiple steps aheadq-fin.ST
The paper develops a method to forecast financial risk multiple steps ahead using quantile time series and historical simulation.
problem Forecasting financial risk multiple steps ahead with accurate estimation of Value-at-Risk (VaR) and Expected Shortfall (ES).
method Quantile-based, semi-parametric historical simulation estimation of VaR and ES models, using quantile loss function and resampling.
result The proposed method accurately forecasts VaR and ES one and multiple steps ahead, superior to existing methods.
The issue addressed in this paper is that of testing for common breaks across or within equations of a multivariate system. Our framework is very general and allows integrated regressors and trends as well as stationary regressors. The null hypothesis is that breaks in different parameters occur at common locations and…
Robust model detects outliers in spatiotemporal epidemic data.
problem Outliers in epidemic data can mislead public health decisions.
method RST-GAM with mean-shift, adaptive Lasso, splines, and proximal algorithm.
result Demonstrates effectiveness in real-world COVID-19 data analysis.
Paper develops methods for inference on time series data using neural networks and sieves.
problem Inference on time series data with nonparametric conditional moment restrictions.
method GN-QLR based inference using general nonlinear sieves and multilayer neural networks.
result Optimally weighted GN-QLR statistic is asymptotically Chi-square distributed.
The maximum number of maximum cliques in a graph is determined for graphs with at least 15 vertices.
problem Determining the maximum number of maximum cliques in a graph with n vertices.
method Defining prime and composite graphs, analyzing edge bounds, and using combinatorial arguments.
result For graphs with at least 15 vertices, the graph with the maximum number of maximum cliques is composite.
SEM-DNN learns reciprocal interactions from observational data without external instruments.
problem Estimating bidirectional interactions from endogenous data.
method Heteroscedastic neural simultaneous-equation estimator (SEM-DNN) that learns reciprocal structural interactions.
result SEM-DNN recovers structural effects more reliably than other methods under increasing information.
The paper establishes maximum principles and stochastic completeness for pseudo-Hermitian manifolds.
problem Maximum principles and stochastic completeness for pseudo-Hermitian manifolds.
method Established generalized maximum principles and proved stochastic completeness equivalence.
result Stochastic completeness for the heat semigroup is equivalent to generalized maximum principles.
One of the earliest conjectures in computational learning theory-the Sample Compression conjecture-asserts that concept classes (equivalently set systems) admit compression schemes of size linear in their VC dimension. To-date this statement is known to be true for maximum classes---those that possess maximum cardinali…
The study classifies graphs with specific curvature and maximum degree.
problem Graphs with nonnegative Ricci curvature and maximum degree constraints.
method Classification of graphs with Lin-Lu-Yau-Ollivier Ricci curvature, maximum degree ≤ 3, and diameter ≥ 6.
result Classification of graphs meeting the specified criteria.
A new algorithm learns diverse policies in reinforcement learning.
problem Learning diverse behaviors in reinforcement learning.
method Proposes Maximum Entropy Diverse Exploration (MEDE) algorithm.
result The set of policies learned by MEDE capture the same modalities as the optimal maximum entropy policy.
A new classifier updates sequentially using maximum margin principles.
problem Sequential data collection and partial labeling.
method Maximum margin classifier with Maximum Entropy Discrimination principle, kernel representation, and regularization.
result Improved performance compared to non-sequential classifiers.
Study the maximum genus of Jenga-like configurations.
problem Determine the maximum genus of Jenga-like structures.
method Treat Jenga blocks as a polyhedral surface and calculate its genus.
result Determine the maximum genus of generalized Jenga games.
We find the maximum mutual information for neural networks and its key determinants.
problem Understanding the maximum mutual information in neural architectures.
method Derived closed-form expression for maximum mutual information across neural network families.
result Maximum mutual information stems from a generalized formula and is influenced by network width and statistical invariances.
In this paper we present a proof of a Neumann type maximum principle for the Laplace operator on compact Riemannian manifolds. A key p oint is the simple geometric nature of the constant in the a priori estimate of this maximum principle. In particular, this maximum principle can be applied to manifolds with Ricci curv…
Establishes a boundary maximum principle for varifolds with fixed contact angle.
problem Boundary behavior of varifolds with contact angle constraints.
method Maximum principle for stationary pairs of varifolds with fixed contact angle condition.
result Boundary maximum principle proven for stationary varifolds.
Maximum likelihood estimation fails to be well-posed in Gaussian process regression.
problem Establishing well-posedness of maximum likelihood estimation in Gaussian process regression.
method Analyzing the conditions under which maximum likelihood estimation is not Lipschitz in the data with respect to the Hellinger distance.
result Maximum likelihood estimation is not well-posed in the noiseless data setting for any Gaussian process with a stationary covariance function whose lengthscale parameter is estimated using maximum likelihood.
Note establishes a local maximum principle for Ricci flow under curvature conditions.
problem Preserving nonnegativity of curvature along Ricci flow with unbounded curvature.
method Combining scaling invariant curvature condition with Dirichlet heat kernel estimates.
result Unified and more direct proof of localized maximum principle.
Modeling Maximum drawdown Records with Piecewise Deterministic Markov Processe in Capital Marketsq-fin.RM
Modeling maximum drawdown records in capital markets using PDMP.
problem Capturing the statistical properties of maximum drawdown records in financial markets.
method Piecewise Deterministic Markov Process (PDMP) for modeling, statistical analysis of mean and variance, simulation study, parameter estimation techniques.
result Derivation of statistical results including mean and variance of maximum drawdown records.
We present a new statistical learning paradigm for Boltzmann machines based on a new inference principle we have proposed: the latent maximum entropy principle (LME). LME is different both from Jaynes maximum entropy principle and from standard maximum likelihood estimation.We demonstrate the LME principle BY deriving …
New Bianchi-convex sets generalize Ricci flow maximum principle.
problem Generalizing maximum principle for Ricci flow.
method Introducing Bianchi-convex sets.
result Hamilton's maximum principle extended to Bianchi-convex sets.
The paper calculates genus bounds for multibranched surfaces.
problem Finding genus bounds for multibranched surfaces.
method Using the first Betti number and boundary genus, the paper provides lower bounds for maximum and minimum genus.
result The maximum and minimum genus of equals twice that of .
Improved text summarization using belief propagation on weighted bipartite graphs.
problem Text summarization from a graph theory perspective.
method Generalized belief propagation algorithm for weighted bipartite graphs.
result Our algorithm outperforms greedy methods in text summarization tasks.
Study proves Maximum Principles for unbounded Riemannian domains.
problem Proving Maximum Principles for unbounded Riemannian domains.
method Examines both ambient manifold and differential operator assumptions.
result Valid Maximum Principles established for unbounded domains.
Study connects spectral clustering to maximum margin and level set estimation.
problem Connecting spectral clustering to maximum margin and level set estimation.
method Obtained bounds on eigenvectors of graph Laplacian matrices in terms of cluster separation and connectivity. Showed sensitivity mitigation by removing outliers and estimating level sets.
result Spectral clustering converges to maximum margin clustering as scaling parameter approaches zero.