Study evaluates methods for expanding communities in hypergraphs using random walks.
problem Expanding communities in hypergraphs using random walks.
method Clique-expansion and tensor methods evaluated; hybrid method proposed.
result Parameter regimes identified where methods outperform each other.
Efficiently handles large support vectors in kernelized online learning.
problem Efficiency in communication for large support vectors in kernelized models.
method Extends a previously proposed protocol to kernelized online learners, introducing a novel communication criterion.
result Communication is bounded by the loss suffered, improving efficiency.
New method uses Ricci curvature for hypergraph clustering, outperforming existing techniques.
problem Community detection in hypergraphs with large hyperedges.
method Extending Ricci flow to hypergraphs by defining edge probability measures and transporting them on the line expansion.
result Enhanced sensitivity to hypergraph structure, especially in large hyperedges.
Secure Aggregation protocols allow a collection of mutually distrust parties, each holding a private value, to collaboratively compute the sum of those values without revealing the values themselves. We consider training a deep neural network in the Federated Learning model, using distributed stochastic gradient descen…
As research into community finding in social networks progresses, there is a need for algorithms capable of detecting overlapping community structure. Many algorithms have been proposed in recent years that are capable of assigning each node to more than a single community. The performance of these algorithms tends to …
With the increase in the amount of data and the expansion of model scale, distributed parallel training becomes an important and successful technique to address the optimization challenges. Nevertheless, although distributed stochastic gradient descent (SGD) algorithms can achieve a linear iteration speedup, they are l…
Bayesian adaptive PCE method improves surrogate modeling and sensitivity analysis.
problem Lack of fully Bayesian PCE methods in statistics.
method Developed a novel fully Bayesian adaptive PCE method with R implementation.
result Bayesian adaptive PCE provides competitive performance for various UQ tasks.
Community detection is, at its core, an attempt to attach an interpretable function to an otherwise indecipherable form. The importance of labeling communities has obvious implications for identifying clusters in social networks, but it has a number of equally relevant applications in product recommendations, biologica…
The UCR Time Series Archive - introduced in 2002, has become an important resource in the time series data mining community, with at least one thousand published papers making use of at least one data set from the archive. The original incarnation of the archive had sixteen data sets but since that time, it has gone th…
FedSARSA converges with heterogeneous agents, achieving linear speed-up.
problem Convergence analysis of Federated SARSA with heterogeneous agents.
method Linear function approximation, local training, multi-step error expansion.
result FedSARSA achieves linear speed-up with respect to the number of agents.
In this work, we propose an algorithm to price American options by directly solving the dual minimization problem introduced by Rogers. Our approach relies on approximating the set of uniformly square integrable martingales by a finite dimensional Wiener chaos expansion. Then, we use a sample average approximation tech…
The paper develops methods to infer membership probabilities and rank network nodes using the DCMM model.
problem Understanding the latent structure of network data, especially in mixed-membership models.
method Degree-Corrected Mixed Membership (DCMM) model, novel finite-sample expansion, asymptotic distributions, confidence intervals, multiplier bootstrap method.
result Valid inference on membership probabilities and node rankings, quantifying uncertainty.
Collectively, machine learning (ML) researchers are engaged in the creation and dissemination of knowledge about data-driven algorithms. In a given paper, researchers might aspire to any subset of the following goals, among others: to theoretically characterize what is learnable, to obtain understanding through empiric…
Rescaling expansiveness proven for k*-expansive vector fields.
problem Proving rescaling expansiveness for k*-expansive vector fields.
method Introducing and exploring singular-expansive flows.
result Rescaling expansiveness established for k*-expansive vector fields.
The paper derives expansions for Green's operators and resolvents using Hadamard methods.
problem Analyzing normally hyperbolic operators and their Green's functions.
method Hadamard expansions for powers of Green's operators and resolvents.
result Derives expansions involving Hadamard coefficients for advanced/retarded Green's operators.
New method estimates intrinsic dimensionality using angles, not distances.
problem Estimating local intrinsic dimensionality accurately.
method Introduces a new estimator using the distribution of angles between neighbor points.
result New estimator behaves similarly but complementarily to existing measures of intrinsic dimensionality.
Develops a martingale expansion for stochastic volatility models.
problem Approximating marginal distributions of stochastic volatility models.
method Martingale expansion framework for continuous stochastic volatility models.
result First-order perturbation expansions for small volatility-of-volatility and fast mean-reversion models.
Taylor expansions improve reinforcement learning policies.
problem Improving reinforcement learning policy optimization.
method Taylor expansion policy optimization.
result Taylor expansions enhance performance of distributed algorithms.
Analytic torsion expansions for symmetric and complex homogeneous spaces.
problem Calculating the full asymptotic expansion of analytic torsion for various spaces.
method Explicit calculation and comparison with existing results.
result Explicit full asymptotic expansions for symmetric and complex homogeneous spaces.
Photonic co-processor speeds up training of large neural networks.
problem Training large neural networks with backpropagation is inefficient and communication is a bottleneck.
method Direct Feedback Alignment (DFA) with a photonic accelerator.
result Photonic accelerator can compute random projections with trillions of parameters.
Proved cyclotomic expansion for double twist knots' HOMFLY-PT invariants.
problem Proving cyclotomic expansion for colored HOMFLY-PT invariants of double twist knots.
method Cyclotomic expansion formula for double twist knots.
result Confirmed cyclotomic expansion conjecture for SU(N)-invariants.
Study of hypersurfaces with specific expansion properties.
problem Existence and properties of hypersurfaces with prescribed null expansion.
method Adapted Eichmair's Perron approach for existence.
result Topology theorem for hypersurfaces with prescribed null expansion.
A new hypergraph expansion method treats vertices and hyperedges equally, improving node classification.
problem Information loss in hypergraph expansions on either vertex or hyperedge level.
method Proposes a new hypergraph formulation named line expansion (LE) that treats vertices and hyperedges symmetrically.
result The proposed line expansion method outperforms state-of-the-art baselines on five hypergraph datasets.
Asymmetric expansion preserves convexity in hyperbolic geometry.
problem Maintaining convexity in hyperbolic geometry under asymmetric expansions.
method Generalizing earlier results on radial expansion to asymmetric expansion.
result Asymmetric expansion of hyperbolic convex sets remains convex.
The paper calculates asymptotic expansions for specific types of oscillatory integrals.
problem Analyzing oscillatory integrals with complex phase functions.
method Using asymptotic expansions of simpler phase functions to derive results for more complex cases.
result Explicit computation of coefficients in asymptotic expansions for certain integrals.
Dropout increases the generalization of neural networks by expanding the weight space.
problem Understanding and improving the generalization of neural networks.
method Introducing weight expansion and showing that dropout leads to it.
result Dropout increases the generalization of neural networks by expanding the weight space.
New derivation of knot invariants from universal invariant.
problem Deriving knot invariants from universal invariant.
method Using Hopf algebra D and a Mathematica implementation to compute ZD(K). result Derivation of large-color expansion from universal invariant.
This work explores functional expansions to handle path dependence in various fields.
problem Path dependence and infinite-dimensional problems in non-Markovian systems.
method Generalizes Wiener series and functional Taylor expansion to handle static and dynamic functionals.
result Elegant separation of functionals from future trajectories in dynamic cases.
In the planar limit of the 't Hooft expansion, the Wilson-loop average in 3d Chern-Simons theory (i.e. the HOMFLY polynomial) depends in a very simple way on representation (the Young diagram), so that the (knot-dependent) Ooguri-Vafa partition function becomes a trivial KP tau-function. We study higher genus correctio…
Paper calculates third coefficient in Kaehler-Einstein metric expansion.
problem Understanding Kaehler-Einstein metrics and their epsilon functions.
method Computes the third coefficient in the TYCZ-expansion of the epsilon function.
result Discovers the vanishing of the third coefficient's significance.
Study on heat trace expansion for thermoelastic Dirichlet-to-Neumann map.
problem Asymptotic expansion of heat trace for thermoelastic Dirichlet-to-Neumann map.
method Provided a method to obtain all coefficients of the asymptotic expansion.
result Explicitly gave the first two coefficients involving volume and total mean curvature of the boundary.
We expand volatility models for rough stochastic volatility.
problem Modeling rough stochastic volatility.
method Vol-of-vol expansion for potentially infinite dimensional models.
result Explicit representations of push-down Malliavin weights.
The paper proposes and proves asymptotic expansions for quantum invariants.
problem Quantum invariants and their expansions under varying metrics.
method Asymptotic expansion conjectures for relative Reshetikhin-Turaev, Turaev-Viro invariants and quantum 6j-symbols.
result Proved asymptotic expansions for special cases, showing geometric dependence on metrics.
New method models portfolios with leptokurtic risk factors using Gram-Charlier expansions.
problem Modeling portfolios with excess kurtosis.
method GC-like expansions of the hyperbolic-secant law to account for leptokurtosis.
result Portfolio distribution with risk factors modeled as GC-like expansions of the HS law.
Develops AMITE for analyzing neural network nonlinearities.
problem Addressing difficulties in verification, explainability, and security in neural network analysis.
method Analytically modified integral transform expansion (AMITE) for neural network nonlinearities.
result First to provide six mutually exclusive desired expansion properties.
Paper presents new expansions for option pricing with cash dividends.
problem No exact formula for European options with cash dividends.
method Uses Etore and Gobet's technique for piecewise lognormal process with jumps.
result Provides more robust first, second, and third-order expansions.
We survey recent results about the asymptotic expansion of Toeplitz operators and their kernels, as well as Berezin-Toeplitz quantization. We deal in particular with calculation of the first coefficients of these expansions.
The validity of an approximation formula for European option prices under a general stochastic volatility model is proved in the light of the Edgeworth expansion for ergodic diffusions. The asymptotic expansion is around the Black-Scholes price and is uniform in bounded payoff func- tions. The result provides a validat…
The paper uses polyhedral expansions to capture the shape of compact metric spaces.
problem Capturing the shape of compact metric spaces using finite approximations.
method Inverse sequences of polyhedra based on finite approximations of a compact metric space.
result Proves the General Principle and computes inverse persistent homology groups.
We provide a general method to compute a Taylor expansion in time of implied volatility for stochastic volatility models, using a heat kernel expansion. Beyond the order 0 implied volatility which is already known, we compute the first order correction exactly at all strikes from the scalar coefficient of the heat kern…
We quantify predictive uncertainty using the posterior predictive variance.
problem Quantifying uncertainty in predictive models.
method Using the law of total variance, we generate expansions for the posterior predictive variance.
result Identify the main contributors to prediction intervals and quantify term-wise uncertainty.
The study improves volatility model pricing accuracy with new statistical expansions.
problem Improving option pricing accuracy in volatility models.
method Developed Edgeworth expansions for various volatility models.
result Enhanced statistical expansions for volatility models.
For any strictly positive martingale S=exp(X) for which X has a characteristic function, we provide an expansion for the implied volatility. This expansion is explicit in the sense that it involves no integrals, but only polynomials in the log strike. We illustrate the versatility of our expansion by computing t…
The notion of a symplectic expansion directly relates the topology of a surface to formal symplectic geometry. We give a method to construct a symplectic expansion by solving a recurrence formula given in terms of the Baker-Campbell-Hausdorff series.
BERET improves binary expansion test for multivariate independence.
problem Testing independence of random vectors in arbitrary dimensions.
method Ensemble approach using sum of squared symmetry statistics and distance correlation.
result Improves power while preserving interpretability.
Researchers calculate the second coefficient in the expansion of a Toeplitz operator.
problem Analyzing the second coefficient in the semi-classical expansion of Toeplitz operators.
method Functional calculus of Toeplitz operators with Reeb vector fields and asymptotic analysis.
result The second coefficient of the expansion is calculated.
Density expansions for hypoelliptic diffusions (X1,...,Xd) are revisited. In particular, we are interested in density expansions of the projection (XT1,...,XTl), at time T>0, with l≤d. Global conditions are found which replace the well-known "not-in-cutlocus" condition known from heat-kernel asymptot…
We develop a first order expansion for convex penalized estimators in high-dimensional regression.
problem High-dimensional regression problems with random designs.
method Construct a first order expansion η of the penalized estimator β^. result The risk of β^ is asymptotically the same as the risk of η.