Bayesian model for sparse graphs with flexible degree distribution and overlapping communities.
problem Modeling sparse graphs with flexible degree distributions and overlapping communities.
method Non-projective inhomogeneous random graph models with specific link probability for scalable posterior inference.
result The model can provide a good fit to the degree distribution and recover well the latent community structure.
Bias and flexibility trade off in learning algorithms.
problem Understanding the trade-off between bias and expressivity in learning algorithms.
method Measuring expressivity using entropy on algorithm outcome distributions, and deriving bounds on bias and expressivity.
result There is a necessary trade-off between bias and expressivity in learning algorithms.
New inequality for odd-degree flexible curves using surface doubling.
problem Bounding the number of non-empty ovals of odd-degree flexible curves.
method Defining an Arnold surface for odd-degree flexible curves and using it to derive a Viro--Zvonilov-type inequality.
result Upper bound on the number of non-empty ovals of odd-degree flexible curves.
We consider the problem of training generative models with deep neural networks as generators, i.e. to map latent codes to data points. Whereas the dominant paradigm combines simple priors over codes with complex deterministic models, we argue that it might be advantageous to use more flexible code distributions. We de…
In this paper we study infinitesimal and finite flexibility for generic semidiscrete surfaces. We prove that generic 2-ribbon semidiscrete surfaces have one degree of infinitesimal and finite flexibility. In particular we write down a system of differential equations describing isometric deformations in the case of exi…
We consider the problem of training generative models with deep neural networks as generators, i.e. to map latent codes to data points. Whereas the dominant paradigm combines simple priors over codes with complex deterministic models, we propose instead to use more flexible code distributions. These distributions are e…
Distributed computing offers a high degree of flexibility to accommodate modern learning constraints and the ever increasing size of datasets involved in massive data issues. Drawing inspiration from the theory of distributed computation models developed in the context of gradient-type optimization algorithms, we prese…
This paper determines the flexible exponent for non-geometric 3-manifolds.
problem Bounding the mapping degree in terms of the Lipschitz constant for non-geometric 3-manifolds.
method Analyzing the infimum of α such that the inequality holds for any Lipschitz map.
result The flexible exponent for non-geometric 3-manifolds is determined.
New risk class penalizes loss deviations from mean on both sides.
problem Current risks are sensitive to loss tails on the upside and ignore the downside.
method Introduces a bi-directional risk class with flexible tail sensitivity.
result Derives high-probability learning guarantees without gradient clipping.
Adma proposes a flexible loss function for neural networks.
problem Static loss functions limit neural network performance.
method Introduces a flexible loss function that adapts to ANN complexity and data distribution.
result Flexible loss function achieves state-of-the-art performance.
TDistNNs improve prediction intervals for neural networks by using t-distributions.
problem Traditional neural networks provide only point estimates, lacking predictive uncertainty.
method TDistNNs generate t-distributed outputs with adjustable degrees of freedom, enhancing robustness to non-Gaussian data.
result TDistNNs produce narrower prediction intervals with proper coverage compared to Gaussian-based PNNs.
Flexible links have symplectic representatives in complex projective space.
problem Existence of symplectic representatives for flexible links.
method Construction of a symplectic surface invariant under complex conjugation.
result No obstructions to finding symplectic representatives beyond classical topology.
New bounds on mapping degrees for geometric 3-manifolds.
problem Bounding the mapping degree in terms of Lipschitz constant for geometric 3-manifolds.
method Constructing Legendrian maps to prove bounds on flexible exponent.
result Complete result for flexible exponent of geometric 3-manifolds.
Seglearn is an open-source python package for machine learning time series or sequences using a sliding window segmentation approach. The implementation provides a flexible pipeline for tackling classification, regression, and forecasting problems with multivariate sequence and contextual data. This package is compatib…
EFDM models spatial point processes with variable cardinality using existence variables.
problem Challenges in extending diffusion models to variable-cardinality spatial point processes.
method Existence-field diffusion model (EFDM) that jointly models spatial locations and cardinality without discrete transitions.
result EFDM achieves improved modeling capability on datasets with varying cardinality.
New method for automatically smoothing GAMs in large datasets.
problem Lack of reliable and fast methods for automatic smoothing in large datasets of GAMs.
method Empirical Bayes approach with an approximate expectation-maximization algorithm involving double Laplace approximation.
result The method achieves state-of-the-art accuracy and is faster than existing methods.
We define and study the statistical models in exponential family form whose sufficient statistics are the degree distributions and the bi-degree distributions of undirected labelled simple graphs. Graphs that are constrained by the joint degree distributions are called dK-graphs in the computer science literature and…
We present a flexible approach for the valuation of interest rate derivatives based on Affine Processes. We extend the methodology proposed in Keller-Ressel et al. (2009) by changing the choice of the state space. We provide semi-closed-form solutions for the pricing of caps and floors. We then show that it is possible…
The stochastic block model is a powerful tool for inferring community structure from network topology. However, it predicts a Poisson degree distribution within each community, while most real-world networks have a heavy-tailed degree distribution. The degree-corrected block model can accommodate arbitrary degree distr…
IFH models graph generation with adjustable sequentiality.
problem Designing flexible graph generation models between one-shot and sequential approaches.
method Based on DDPM, IFH uses a node removal process to generate graphs with adjustable sequentiality.
result IFH models improve graph generation quality and efficiency compared to current methods.
Proposes a risk parity portfolio optimization method that accounts for uncertainty in asset returns.
problem Risk parity portfolio optimization under uncertainty.
method Distributionally robust optimization with ambiguity set for worst-case scenario analysis.
result Distributionally robust risk parity portfolios can yield higher risk-adjusted returns.
New causal models for growing networks avoid node deletion constraints.
problem Statistical models based on node exchangeability are not suitable for growing networks.
method Enumerated and partitioned causal directed acyclic graph (DAG) models over pairs of nodes.
result Simple model exhibits flexible power-law degree distributions and emergent phase transitions.
A new distribution family extends the α-stable distribution with a degree of freedom parameter.
problem Lack of moments in the α-stable distribution. method Wright function framework to combine and extend distribution families.
result Generalized α-stable distribution with valid moments. We introduce the problem of learning mixtures of k subcubes over {0,1}n, which contains many classic learning theory problems as a special case (and is itself a special case of others). We give a surprising nO(logk)-time learning algorithm based on higher-order multilinear moments. It is not possible to l…
New method for robust financial portfolio analysis.
problem Challenges in modeling financial portfolio dependence structure.
method Nonparametric Angles-based Correlation (NAbC) method.
result Valid inferences and flexible scenarios for portfolio analysis.
Develops a new tensor model for clustering with degree correction.
problem Clustering with unknown degree heterogeneity in multiway data.
method Degree-corrected tensor block model with estimation guarantees.
result Demonstrates an intrinsic statistical-to-computational gap for tensors of order three or greater.
Mixtures of multivariate contaminated shifted asymmetric Laplace distributions are developed for handling asymmetric clusters in the presence of outliers (also referred to as bad points herein). In addition to the parameters of the related non-contaminated mixture, for each (asymmetric) cluster, our model has one param…
We prove a singular Darboux type theorem for homogeneous polynomial closed 2-forms of degree one on Cn. As application, we classify non-integrable codimension one distributions, of degree one, and arbitrary classes on projective spaces.
New method models asymmetric data with improved tail dependence.
problem Asymmetric data and tail dependence modeling.
method Generalized Skew-t Probabilistic Principal Component Analysis.
result Improved modeling of asymmetric data with tail effects.
This paper tests the multivariate normality of node degrees in Erdős-Rényi graphs.
problem Testing the multivariate normality of node degrees in Erdős-Rényi graphs.
method Chi-square goodness of fit test, Anderson-Darling test, CDF comparison, maximum likelihood estimation.
result The degrees of nodes in Erdős-Rényi graphs do not follow a multivariate normal distribution, but the approximation is valid for large values of n and p.
This paper analyzes the trade-off between accuracy and communication in personalized federated learning.
problem The accuracy-communication trade-off in personalized federated learning.
method The paper provides a quantitative characterization of the personalization degree on the trade-off, establishing minimax optimality.
result The paper offers theoretical insights for choosing the personalization degree and validates the results on synthetic and real-world datasets.
Combines MCTM and NF for flexible multivariate density regression with interpretable marginals.
problem Difficult interpretation of flexible NF models and limitations of MCTM in flexibility.
method Hybrid approach combining MCTM for interpretable marginals and NF for complex joint distributions.
result Demonstrates versatility and improved performance compared to MCTM and other NF models.
Flexible evidential deep learning improves uncertainty quantification in machine learning.
problem Overconfident predictions in machine learning models can lead to serious consequences.
method Proposes flexible evidential deep learning (F-EDL) to model uncertainty over class probabilities using a flexible Dirichlet distribution.
result Empirically demonstrates state-of-the-art uncertainty quantification performance across diverse scenarios.
The paradox of the energy transition is that the low marginal costs of new renewable energy sources (RES) drag electricity prices down and discourage investments in flexible productions that are needed to compensate for the lack of dispatchability of the new RES. The energy transition thus discourages the investments t…
Proposes SQUAD for better predictive uncertainty in deep latent models.
problem Intractable inference in deep latent variable models lead to overconfident predictions.
method Introduces Stochastic Quantized Activation Distributions (SQUAD) for flexible yet tractable latent variable distributions.
result The model provides competitive quality predictive uncertainty and learns non-linearities.
TM-VI uses flexible transformation models to approximate complex posteriors in Bayesian models.
problem Approximating complex posteriors in Bayesian models with limited flexibility.
method Transformation models for variational inference (TM-VI).
result TM-VI allows accurate approximation of complex posteriors in models with one parameter and works in a mean-field fashion for multi-parameter models.
Personalized federated learning for diverse client objectives.
problem Training a single global model across diverse local datasets is not optimal.
method Efficiently calculates optimal weighted model combinations for each client based on their specific objectives.
result Our method outperforms existing alternatives and enables new personalized features.
A new method reparameterizes Gaussian noise for better flexibility and performance.
problem Improving the Gumbel-Softmax for better flexibility and performance.
method Invertible Gaussian Reparameterization (IGR) using modified softmax and transformations.
result IGR outperforms Gumbel-Softmax in various experiments.
Study improves understanding of network degree distributions using non-linear ERGs.
problem Lack of models capable of accounting for the variance of empirical degree distributions.
method Defined a fitness-induced variant of the two-star model to reproduce sample variance.
result Non-linear ERGs can reproduce the sample variance of empirical degree distributions.
The article proves the existence of horizontal immersions into fat distributions and contact structures.
problem Proving the existence of horizontal immersions in fat distributions and contact structures.
method Gromov's sheaf theoretic and analytic techniques of h-principle. result Existence of horizontal immersions of an arbitrary manifold into degree 2 fat distributions and quaternionic contact structures.
Paper introduces a new edge exchangeable block model for complex networks.
problem Limitations of the stochastic block model in analyzing complex networks.
method Develops a Bayesian nonparametric edge exchangeable block model.
result The new model outperforms state-of-the-art SBMs for link prediction.
Copula-based normalizing flows improve flexibility and stability for heavy-tailed data.
problem Limited expressive power of vanilla normalizing flows.
method Generalize base distribution to copula for more accurate representation of target distribution.
result Copula-based normalizing flows improve flexibility, stability, and effectiveness for heavy-tailed data.
New spectral clustering method for graphs with uneven node degrees.
problem Challenges in community detection for graphs with heterogeneous degree distributions.
method Spectral clustering on spherical coordinates with degree correction.
result Improved performance in representing computer networks.
No regularization needed for InLDL, achieving efficient and effective model.
problem InLDL struggles with performance degradation due to missing degrees.
method Proposes a model that uses label distribution as a prior, implicitly regularizing the learning process.
result Achieves competitive performance without explicit regularization.
Automates detection of fast-ramped flexibility events for DSOs.
problem Monitoring and supervising flexibility activations in power systems.
method Unsupervised detection and open-set classification.
result Automatically identifies critical flexibility activations for early intervention.
A functorial semi-norm on singular homology is a collection of semi-norms on the singular homology groups of spaces such that continuous maps between spaces induce norm-decreasing maps in homology. Functorial semi-norms can be used to give constraints on the possible mapping degrees of maps between oriented manifolds. …
We show that the presence of a plastikstufe induces a certain degree of flexibility in contact manifolds of dimension 2n+1>3. More precisely, we prove that every Legendrian knot whose complement contains a "nice" plastikstufe can be destabilized (and, as a consequence, is loose). As an application, it follows in certai…
A new model corrects SBM's bias for power-law degree networks.
problem SBM's incapability to handle power-law degree distributions.
method Introducing degree decay variables to encode varying degree distributions.
result PLD-SBM approximately preserves the scale-free feature in real networks and corrects SBM's bias.