Autoencoders improve communication system performance by optimizing constellation geometry and probability.
problem Optimizing constellation geometry and probability for better communication system performance.
method Leveraging autoencoders to learn capacity-achieving symbol distributions and constellations.
result Learned constellations achieve information rates very close to capacity on AWGN channels and outperform existing methods on fading channels.
In this paper, an unsupervised machine learning method for geometric constellation shaping is investigated. By embedding a differentiable fiber channel model within two neural networks, the learning algorithm is optimizing for a geometric constellation shape. The learned constellations yield improved performance to sta…
A new geometric shaping method is proposed, leveraging unsupervised machine learning to optimize the constellation design. The learned constellation mitigates nonlinear effects with gains up to 0.13 bit/4D when trained with a simplified fiber channel model.
Gradient descent finds better constellations for GMI-based learning.
problem Nonconvexity in end-to-end GMI learning.
method Gradient descent initialized with Gray-labeled APSK constellations.
result State-of-the-art constellations in 2D and 4D provide up to 26% reach increase.
New scheme optimizes BMI through probabilistic and geometric shaping.
problem Optimizing bit-wise mutual information (BMI) for coded modulation.
method Joint optimization of BMI through probabilistic and geometric shaping.
result Joint optimization enables a continuum of constellation geometries and probability distributions.
Autoencoder shapes QAM symbols for improved GMI performance.
problem Improving Geometric Mean Information (GMI) in QAM constellation shapes.
method End-to-end learning of bit mappings using autoencoders.
result Achieved up to 0.2 bits/QAM symbol gain in GMI.
Machine learning is used to compute achievable information rates (AIRs) for a simplified fiber channel. The approach jointly optimizes the input distribution (constellation shaping) and the auxiliary channel distribution to compute AIRs without explicit channel knowledge in an end-to-end fashion.
New MIMO constellation design for noncoherent communications reduces hardware complexity.
problem Designing efficient MIMO constellations for noncoherent communications over fading channels.
method Geodesic curves of the Grassmann manifold for structured constellation design.
result Achieves comparable error performance to unstructured designs with reduced hardware complexity.
This paper studies a new application of deep learning (DL) for optimizing constellations in two-way relaying with physical-layer network coding (PNC), where deep neural network (DNN)-based modulation and demodulation are employed at each terminal and relay node. We train DNNs such that the cross entropy loss is directl…
Starfield optimizes satellite links for LEO mega-constellations by aligning ISLs with regional traffic patterns.
problem Forming a stable satellite topology in LEO mega-constellations with limited ISLs and unstable acquisition.
method Starfield uses a demand-aware heuristic algorithm based on traffic flows and Riemannian geometry to assign satellite links.
result Starfield reduces hop count and improves stretch factor by up to 30% compared to existing methods.
Constellation learns group-level visual relationships for abstract reasoning.
problem Learning configurational properties of entire groups of objects.
method Introduces Constellation, a network that learns relational abstractions over static visual scenes.
result Offers a basis for abstract relational reasoning and sensory imagination.
This paper addresses the problem of blind demixing of instantaneous mixtures in a multiple-input multiple-output communication system. The main objective is to present efficient blind source separation (BSS) algorithms dedicated to moderate or high-order QAM constellations. Four new iterative batch BSS algorithms are p…
Develops a neural network for MIMO-OFDM systems with low-resolution ADCs.
problem Low-resolution ADCs make channel information blind to the BS, complicating equalization.
method Supervised learning framework with a new activation function and unsupervised loss.
result Proposed equalizer outperforms existing ones, especially in unclear channel conditions.
We consider optimal consumption and portfolio choice in the presence of Knightian uncertainty in continuous-time. We embed the problem into the new framework of stochastic calculus for such settings, dealing in particular with the issue of non-equivalent multiple priors. We solve the problem completely by identifying t…
In this letter, we derive the optimal discriminant functions for modulation classification based on the sampled distribution distance. The proposed method classifies various candidate constellations using a low complexity approach based on the distribution distance at specific testpoints along the cumulative distributi…
In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This enhances the already known results by Frucht, Cori -- Machì, Širáň -- Škoviera, and …
Compact satellite tech detects flooded areas quickly.
problem Rapid access to satellite data and automatic flood detection.
method Automatically identifies cloud, water, and land in satellite images onboard small satellites.
result Reduced downlink bandwidth by 2 orders of magnitude.
Paper predicts GNSS phase scintillations with machine learning.
problem Predicting phase scintillations due to ionosphere disturbances.
method Proposes a novel machine learning architecture and loss function.
result Achieves state-of-the-art prediction of phase scintillations 1 hour in advance.
Synthesizes static analysis for probabilistic programs.
problem Optimize learning process, verify models, improve programming interface.
method Organize and analyze static analysis techniques for probabilistic programming.
result Future directions for improvement in statistical machine learning.
Lawson-Osserman constructed three types of non-parametric minimal cones of high codimensions based on Hopf maps between spheres, which correspond to Lipschitz but non-differentiable solutions to the minimal surface equations, thereby making sharp contrast to the regularity theorem for minimal graphs of codimension 1. I…
Geomstats introduces shape module for analyzing shapes of objects.
problem Analyzing shapes of objects represented as landmarks, curves, and surfaces.
method Implementing shape spaces, group actions, fiber bundles, quotient spaces, and Riemannian metrics.
result Users can compare, average, and interpolate shapes inside shape spaces.
A new shape space allows optimization of non-smooth shapes in fluid mechanics.
problem Optimizing non-smooth shapes in fluid mechanics.
method Constructing a product manifold to include piecewise-smooth shapes.
result Numerical results show applicability in minimizing viscous energy dissipation.
Introduces Star-Shaped deviation measures for risk analysis.
problem Risk measurement and analysis in finance.
method Characterizes Star-Shaped deviation measures through acceptance sets and convex deviation measures.
result Exposes the relationship between Star-Shaped risk measures and deviation measures.
Optimizes shapes in uncertain Navier-Stokes flow problems.
problem Optimizing shapes with geometric constraints and physical uncertainty.
method Multi-shape calculus and stochastic augmented Lagrangian method.
result Successfully optimized shapes in uncertain Navier-Stokes flow.
New framework for portfolio management using binomial markets and game theory.
problem Investment behavior in competitive and incomplete markets.
method Introduces PRFPP framework, constructs and analyzes for both finite and mean field games.
result Relative performance concerns do not always lead to more risky asset investment.
New method reconstructs 3D shapes from 2D images using Kendall's shape space.
problem Reconstruct 3D shapes from 2D images, especially for rare specimens.
method Kendall's shape space approach with prior information.
result More robust and plausible shapes compared to previous methods.
A novel method predicts shape development using Riemannian shape spaces.
problem Predicting future shape development from a single observation.
method Proposes a novel prediction method that encodes shapes in a Riemannian shape space and learns hierarchical statistical models.
result Outperforms deep learning-supported variants and state-of-the-art methods in predicting shape development.
This paper tackles shape denoising in computer vision and medical imaging.
problem Handling shapes with missing pieces or outliers in shape modeling.
method Introduces six types of noise and an objective measure for shape denoising.
result Evaluates seven shape denoising methods, six of which are based on deep learning.
Generative model disentangles 3D shapes into independent factors.
problem Learning rich representations of deformable 3D shapes.
method Supervised 3D mesh-convolutional Variational AutoEncoder with latent feature disentanglement.
result Explicit disentanglement of latent factors improves shape generation and downstream tasks.
In shape analysis, the concept of shape spaces has always been vague, requiring a case-by-case approach for every new type of shape. In this paper, we give a general definition for an abstract space of shapes in a manifold. This notion encompasses every shape space studied so far in the literature, and offers a rigorou…
Paper analyzes shapes of brain arterial networks using statistical methods.
problem Quantifying and comparing shapes of brain arterial networks.
method Mathematical representation of BAN shapes as elastic shape graphs, development of Riemannian metrics and geometrical tools.
result Age has a clear, quantifiable effect on BAN shapes, with increased variance in shapes as age increases.
Develops new shape metrics for high-dimensional objects.
problem Lack of single metrics to describe shape in high dimensions.
method Introduces hyper-Sphericity and hyper-Shape Proportion metrics.
result Discriminates between different shapes in high dimensions.
Paper tackles shape graph registration using neural networks.
problem Constrained registration of shape graphs with varying nodes and edges.
method Shape-Graph Matching Network (SGM-net) with an elastic shape metric loss function.
result State-of-the-art matching performance and reduced computational cost.
In this paper, we describe a novel shape classification method which is embedded in the Bayesian paradigm. We discuss the modelling and the resulting shape classification algorithm for two and three dimensional data shapes. We conclude by evaluating the efficiency and efficacy of the proposed algorithm on the Kimia sha…
Defines finite type Multivalued Shape using hyperspaces.
problem No specific problem stated; focuses on definition.
method Construction over metric compacta using hyperspaces.
result Defines finite type Multivalued Shape.
The paper explores three methods to assign a metric to shape spaces.
problem Assigning a Riemannian metric to shape spaces without parameterization.
method Three methods to put a Riemannian metric on shape spaces.
result Methods provide a way to measure deformations independent of parameterization.
The paper proves inequalities for star-shaped and F-mean convex hypersurfaces in Rn+1.
problem Proving geometric inequalities for specific types of hypersurfaces.
method Using anisotropic p-momentum, perimeter, and volume, the paper derives inequalities for star-shaped and F-mean convex hypersurfaces. result The Wulff shape of F is the unique minimizer of the corresponding functionals among all star-shaped and F-mean convex sets. PointGMM learns hGMMs from point clouds for 3D shape representation.
problem Lack of shape priors and non-local information in point cloud representations.
method Neural network that learns hierarchical Gaussian mixture models (hGMMs) for 3D shapes.
result Generative model learns meaningful latent space for interpolations and novel shape synthesis.
New star-shaped acceptability indexes generalize existing methods.
problem Generalizing existing acceptability measures.
method Characterizing acceptability indexes through star-shaped risk measures and sets.
result Introducing concrete examples linked to various financial measures.
New method learns shape correspondences robustly from raw geometry.
problem Inaccurate and poor generalization of shape correspondences.
method Learning-based approach with feature-extraction network and functional map representation.
result Robust and accurate shape correspondence learning with less training data.
We introduce and develop fine shape, which has a very simple definition and aims to supersede all previously known shape theories for metrizable spaces. The problem with known shape theories of metrizable spaces is illustrated by the following bizarre situation. Čech cohomology is an invariant of shape, and a fortiori …
Classifies shapes of yield curves in the Svensson family.
problem Classifying shapes of yield curves in the Svensson family.
method Complete classification of shapes using mathematical analysis.
result Certain complex shapes cannot appear after a deterministic time horizon.
The paper uses 3D shapes to reveal sundial design adjustments based on latitude.
problem Identifying sundial design adjustments based on installation location.
method Shape analysis in a high-dimensional space, regression in shape space.
result Sundial design adjustments were latitude-dependent.
Shape information is of great importance in many applications. For example, the oil-bearing capacity of sand bodies, the subterranean remnants of ancient rivers, is related to their cross-sectional shapes. The analysis of these shapes is therefore of some interest, but current classifications are simplistic and ad hoc.…
Hausdorff reflection keeps space shape intact.
problem Preserving shape type in spaces.
method Hausdorff reflection method.
result Hausdorff reflection preserves shape type.
Optimizes shapes on non-standard manifolds.
problem Optimization on non-standard infinite-dimensional manifolds.
method Develops gradient descent on weak Riemannian manifolds.
result Establishes foundational properties for optimization on various weak Riemannian manifolds.
Deep neural network predicts cardiac shape from MRI images and patient data.
problem Automatic 3D cardiac shape analysis for large-scale studies.
method Uses deep neural networks combining MRI images and patient metadata.
result Significant agreement with reference shapes in cardiac parameters.
NCG methods improve shape optimization efficiency.
problem Shape optimization problems
method Nonlinear conjugate gradient methods
result NCG methods are efficient for shape optimization