New COS method formula improves option pricing accuracy.
problem Determining the optimal truncation range for COS method.
method Derive new formula using Markov's inequality to ensure convergence.
result New formula leads to more accurate option pricing.
Paper proposes a new co-clustering method for overlapping clusters and outliers.
problem Real-world datasets often contain overlaps and outliers in co-clusters.
method Formulated Non-Exhaustive, Overlapping Co-Clustering problem and developed NEO-CC algorithm.
result NEO-CC algorithm effectively captures underlying co-clustering structure of real-world data.
ecpc R-package improves high-dimensional prediction with co-data.
problem High-dimensional prediction with more variables than samples.
method Adaptive ridge penalised models with co-data, including continuous co-data.
result Improved variable selection and prediction performance.
A new NMF model for co-clustering and data approximation.
problem Finding a low rank approximation for nonnegative data.
method Generalizes separability assumption for NMF, proposing Co-Separable NMF (CoS-NMF).
result CoS-NMF outperforms state-of-the-art methods in co-clustering and data approximation.
Unified method for calculating financial option prices from characteristic functions.
problem Calculating financial option prices from characteristic functions in high dimensions.
method Damped Fourier-cosine expansion (COS) method.
result The method converges exponentially if the characteristic function decays exponentially.
The COS method for European options pricing is improved with a new bound for the number of terms.
problem Determining the optimal number of terms in the COS method for accurate European option pricing.
method Using Fourier-cosine expansion, the study finds an explicit bound for the number of terms N in the cosine series approximation.
result The COS method achieves exponential convergence when the log-return density is smooth, but not when it has heavy tails.
A new NUFFT method speeds up option pricing for various strikes.
problem Efficiently pricing many options of the same maturity but different strikes.
method Non-uniform fast Fourier transform (NUFFT) applied to the COS method.
result Significantly faster computation of option prices.
COS method convergence conditions expanded for heavy-tailed distributions.
problem Ensuring convergence of the COS method for various densities.
method Analyzing truncation error and providing conditions for convergence.
result Conditions for COS method convergence extended to include heavy-tailed distributions.
New method infers co-expression networks robustly from multiple studies.
problem Challenges in inferring co-expression networks from transcriptome data.
method Robust method based on multivariate t-distribution with shared precision matrix.
result Identifies co-expression matrix up to scaling factor.
Randomized spectral co-clustering speeds up large-scale directed networks.
problem Co-clustering directed networks efficiently for large-scale data.
method Randomized spectral co-clustering algorithms using random-projection and random-sampling techniques.
result Theoretical and numerical validation of approximation and misclustering error rates.
Guided adaptive shrinkage uses co-data to improve feature selection in genomic studies.
problem Feature selection challenges in high-dimensional genomics data, especially in clinical settings.
method Guided adaptive shrinkage methods that use co-data to adapt shrinkage parameters.
result Improves feature selection in genomic studies, demonstrated through comparisons and examples.
Multi-view clustering has received much attention recently. Most of the existing multi-view clustering methods only focus on one-sided clustering. As the co-occurring data elements involve the counts of sample-feature co-occurrences, it is more efficient to conduct two-sided clustering along the samples and features si…
Identifying latent structure in large data matrices is essential for exploring biological processes. Here, we consider recovering gene co-expression networks from gene expression data, where each network encodes relationships between genes that are locally co-regulated by shared biological mechanisms. To do this, we de…
This article analyzes the relationship between co-persistence and hedging which indicates co-persistence ratio is just the long-term hedging ratio. The new method of exhaustive search algorithm for deriving co-persistence ratio is derived in the article. And we also develop a new hedging strategy of combining co-persis…
Survey of graph learning methods for combinatorial optimization problems.
problem Efficient and effective analysis of graphs for combinatorial optimization problems.
method Two-stage framework: Graph representation learning followed by machine learning.
result Recent studies have shown promise in using machine learning to solve graph-based combinatorial optimization problems.
A new method for higher-order co-occurrences in hypergraphs.
problem Computing higher-order co-occurrences in hypergraphs.
method Face-splitting product or transpose Khatri-Rao product for higher order tuple co-occurrences.
result Demonstrates the utility of the higher order co-occurrence tensor in NLP and hypergraph models.
Proposes using external data to improve predictions in medical applications with limited samples.
problem Small sample sizes and complex covariate-response relationships in medical data.
method Integrates external co-data into Bayesian Additive Regression Trees (BART) using an empirical Bayes framework.
result Improves prediction accuracy compared to standard BART, especially for nonlinear relationships.
Flexible co-data learning improves clinical prediction models.
problem High-dimensional clinical data challenges prediction accuracy.
method Combining domain knowledge and external studies to estimate adaptive multi-group ridge penalties.
result Improves prediction performance and variable selection stability.
CO-BED optimizes experiments using Bayesian methods and information theory.
problem Optimizing experiments in a context-dependent manner.
method Formalizes contextual optimization with Bayesian experimental design, employing information-theoretic principles and black-box variational methods.
result CO-BED provides a general solution for contextual optimization problems.
Paper provides a method to price electricity storage contracts using COS technique.
problem Valuation of electricity storage contracts considering physical and operational constraints.
method Uses Fourier-based COS method to price contracts based on stochastic polynomial process.
result The COS method accurately and efficiently prices electricity storage contracts.
Sym-NCO leverages symmetricities to improve DRL-NCO performance.
problem Improving neural combinatorial optimization methods.
method Sym-NCO is a regularizer-based training scheme that exploits universal symmetricities in CO problems and solutions.
result Sym-NCO significantly improves DRL-NCO performance across various CO tasks.
This paper demonstrates the flaws of co-persistence theory proposed by Bollerslev and Engle (1993) which cause the theory can hardly be applied. With the introduction of the half-life of decay coefficient as the measure of the persistence, and both the weak definition of persistence and co-persistence in variance, this…
Co-trading networks reveal dynamic market structures and improve covariance estimation.
problem Modeling high-dimensional stock covariances in US equity markets.
method Co-trading-based pairwise similarity measure for constructing dynamic networks, spectral clustering, robust covariance estimator.
result Co-trading networks capture time-evolving stock dependencies and improve portfolio performance.
Two accelerated extragradient methods converge at O(1/k) rate for co-hypomonotone inclusions.
problem Solving co-hypomonotone inclusions with sum of Lipschitz and multivalued operators.
method Developed two Nesterov's accelerated extragradient methods for co-hypomonotone inclusions.
result Achieve O(1/k) last-iterate convergence rates on the residual norm. Improved barrier option pricing in Heston model using COS-BEM method.
problem Efficient barrier option pricing in the Heston model.
method Combining Fourier-cosine series (COS) method with Boundary Element Method (BEM).
result Significant computational efficiency improvement and BEM attractiveness for practitioners.
This paper advances extragradient methods for solving inclusions under co-hypomonotonicity.
problem Solving inclusions with non-Lipschitz mappings.
method Unified and generalized extragradient methods under co-hypomonotonicity.
result Achieved O(1/k) convergence rates for residual norms. We propose a method for calculating cohomology operations for finite simplicial complexes. Of course, there exist well--known methods for computing (co)homology groups, for example, the reduction algorithm consisting in reducing the matrices corresponding to the differential in each dimension to the Smith normal form, …
Paper proposes a new method to improve clustering ensemble performance.
problem Improving clustering ensemble performance by refining co-association matrix.
method Low-rank tensor approximation to derive coherent-link matrix and refine co-association matrix.
result The proposed method achieves breakthrough in clustering performance compared to state-of-the-art methods.
Geometric method captures rare topics and temporal alignment in co-author networks.
problem Missing rare topics and smooth temporal alignment in topic modeling.
method Integrates multimodal text and co-author network data using Hellinger distances and Ward's linkage.
result Effective identification of rare topics and visualization of topic drift over time.
A new method clusters mixed-type data tables effectively.
problem Clustering data with mixed types (numerical and categorical).
method Two-step approach: binarize mixed data, then co-cluster.
result Shows improved clustering of mixed-type data compared to MCA.
Background: The problem of predicting whether a drug combination of arbitrary orders is likely to induce adverse drug reactions is considered in this manuscript. Methods: Novel kernels over drug combinations of arbitrary orders are developed within support vector machines for the prediction. Graph matching methods are …
New metric improves latent dynamics inference from neural data.
problem Limitations of co-smoothing in predicting latent dynamics.
method Few-shot co-smoothing to assess latent dynamics.
result High co-smoothing models often have extraneous dynamics, which few-shot co-smoothing detects.
We quantify how co-jumps impact correlations in currency markets. To disentangle the continuous part of quadratic covariation from co-jumps, and study the influence of co-jumps on correlations, we propose a new wavelet-based estimator. The proposed estimation framework is able to localize the co-jumps very precisely th…
A new CO-Optimal Transport method optimizes transport maps between samples and features.
problem Optimal transport's limitations when samples are on different spaces.
method COOT: a novel OT problem that optimizes transport maps between samples and features simultaneously.
result COOT leads to performance improvements over state-of-the-art methods in domain adaptation and co-clustering.
Co-Clustering, the problem of simultaneously identifying clusters across multiple aspects of a data set, is a natural generalization of clustering to higher-order structured data. Recent convex formulations of bi-clustering and tensor co-clustering, which shrink estimated centroids together using a convex fusion penalt…
Co-branding improves stock performance for firms.
problem Little research on co-branding's impact on firm stock value.
method Developed a conceptual framework and tested hypotheses.
result Co-branding events lead to positive abnormal returns.
A new method identifies sub-populations in unlabelled heterogeneous data by accounting for co-features.
problem Estimating sub-populations in unlabelled heterogeneous data with co-features.
method Mixture of Conditional Gaussian Graphical Models (CGGM) with penalized EM algorithm.
result The method successfully identifies sub-populations disrupted by co-features.
Paper proposes a new method to optimize robot body structure and control policy.
problem Optimizing robot body structure and control policy in a coupled manner.
method Revisits co-design problem as a Stackelberg game, incorporating control adaptation dynamics.
result Stackelberg PPO outperforms standard PPO in stability and performance.
CRA improves UL-based CO solvers by dynamically smoothing and enforcing discreteness.
problem Local optima and artificial rounding issues in UL-based CO solvers.
method Continuous Relaxation Annealing (CRA) strategy that dynamically shifts from continuous to discrete solutions.
result Significantly enhances UL-based CO solver performance and eliminates artificial rounding.
We study the role of co-jumps in the interest rate futures markets. To disentangle continuous part of quadratic covariation from co-jumps, we localize the co-jumps precisely through wavelet coefficients and identify statistically significant ones. Using high frequency data about U.S. and European yield curves we quanti…
We construct a co-dimension 3 completely non-holonomic sub-bundle on the Gromoll-Meyer exotic 7 sphere based on its realization as a base space of a Sp(2)-principal bundle with the structure group Sp(1). The same method is valid for constructing a co-dimension 3 completely non-holonomic sub-bundle on the standard 7…
This paper studies the geometry of the group of all co-Hamiltonian diffeomorphisms of a compact cosymplectic manifold (M,ω,η). The fix-point theory for co-Hamiltonian diffeomorphisms is studied, and we use Arnold's conjecture to predict the exact minimum number of fix point that such a diffeomorphism must have (thi…
A fast method estimates group-adaptive elastic net penalties using co-data.
problem Computational inefficiency in estimating group-adaptive elastic net penalties.
method Derive low-dimensional representation of Taylor approximation for marginal likelihood and its derivative for group-adaptive ridge penalties; approximate elastic net marginal likelihood by ridge; transform ridge penalties to elastic net penalties.
result Significantly decreases computation time and outperforms other methods.
Deep learning reconstructs pressure fields and classifies leakage rates in CCS storage sites.
problem Monitoring CO2 leakage in CCS storage sites.
method Variational auto-encoder tailored for pressure field reconstruction and leakage rate classification.
result Uncertainty estimates of predictions illustrated on synthetic data.
Framework analyzes stock price co-movement with fundamentals using big data.
problem Understanding complex relationships between stock price co-movements and fundamental characteristics.
method Advanced big data techniques, four regression models.
result Identifies leading co-movement stocks and their influencing factors.
Study co-Higgs sheaves on toric varieties, finding explicit examples.
problem Characterizing and understanding co-Higgs sheaves on toric varieties.
method Characterization and explicit computation of examples.
result Explicit examples of co-Higgs sheaves on toric varieties computed.
CoMGNN models heterogeneous graphs with evolving nodes and edges.
problem Modeling complex, evolving graphs with diverse information.
method Meta graph attention on co-evolving heterogeneous graphs.
result Significant improvement over state-of-the-art methods.
Identifies images of determinant morphism for specific co-Higgs bundles.
problem Determining images of determinant morphism for co-Higgs bundles.
method Identifying images of the determinant morphism of trace-free co-Higgs bundles modeled on rank 2 Schwarzenberger bundles.
result Identified images of the determinant morphism for specific co-Higgs bundles.