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…
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.
Deep learning optimizes constellation for two-way relaying networks, boosting sum rate.
problem Optimizing constellation for better performance in two-way relaying networks.
method Deep neural networks (DNNs) trained to minimize cross entropy loss for direct constellation optimization.
result Significant performance gain in achievable sum rate compared to conventional relaying schemes.
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.
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.
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.
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.
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.
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.
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…
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.
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…
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.
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…
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.
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.
Paper presents a new method for better financial market forecasting.
problem Traditional investment strategies fail to capture market nuances and risks.
method Combines deep learning, factor integration, and correlated stock analysis.
result Enhanced diversification and performance capture in financial markets.
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…
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 communication standards need to deal with machine-to-machine communications, in which users may start or stop transmitting at any time in an asynchronous manner. Thus, the number of users is an unknown and time-varying parameter that needs to be accurately estimated in order to properly recover the symbols transmit…
The rough Bergomi (rBergomi) model, introduced recently in [5], is a promising rough volatility model in quantitative finance. It is a parsimonious model depending on only three parameters, and yet remarkably fits with empirical implied volatility surfaces. In the absence of analytical European option pricing methods f…
New partial solution to Hurwitz problem for surface branched covers.
problem Existence of surface branched covers with specific partition lengths.
method Inductive proof on genus and branching points, excluding technology of constellations.
result Identification of exceptional candidate data and their properties.
Bayesian deep learning predicts satellite collisions.
problem Space debris poses planetary risk.
method Bayesian deep learning with LSTM networks.
result Predicts conjunction event evolution with uncertainties.
We construct $\sorth{p} \times \sorth{q}$-invariant special Lagrangian (SL) cones in $\C^{p+q}$. These SL cones are natural higher-dimensional analogues of the $\sorth{2}$-invariant SL cones constructed previously by MH and used in our gluing constructions of higher genus SL cones in $\C^{3}$. We study in detail the ge…
Although timely sepsis diagnosis and prompt interventions in Intensive Care Unit (ICU) patients are associated with reduced mortality, early clinical recognition is frequently impeded by non-specific signs of infection and failure to detect signs of sepsis-induced organ dysfunction in a constellation of dynamically cha…
Improved satellite image captions enhance descriptiveness without large models.
problem Extracting meaningful text from satellite imagery.
method Evaluated seven models on a large benchmark, extended vocabulary, and introduced a novel confusion matrix.
result Reduced model size by 100x without sacrificing accuracy, offering new deployment opportunities.
This paper finds the noise threshold for learning Gaussian mixture models equals channel capacity.
problem Learning Gaussian mixture models with noisy data.
method Bayesian formulation with uniformly distributed centers on a sphere, analyzing the large system limit.
result The maximal noise level σ2 for which GMM learning is as easy as labeled observations is the channel capacity. External or internal shocks may lead to the collapse of a system consisting of many agents. If the shock hits only one agent initially and causes it to fail, this can induce a cascade of failures among neighoring agents. Several critical constellations determine whether this cascade remains finite or reaches the size o…
Bayesian optimization reduces computational effort in aircraft design optimization.
problem High computational cost in industrial aircraft design optimization.
method Constrained Bayesian optimization (Super Efficient Global Optimization with Mixture of Experts)
result Significant computational efficiency improvements over existing Isight optimizers.
Bayesian optimization method tackles combinatorial spaces, scalable for large data.
problem Optimization over combinatorial categorical spaces in natural sciences.
method Combines variational optimization and continuous relaxations for gradient-based optimization.
result Method performs comparably to state-of-the-art methods while scaling well.
New algorithm solves complex stopping problems with robust optimization.
problem Solving complex stochastic optimal stopping problems.
method Simulation-based robust optimization with exact reformulation as a zero-one bilinear program.
result Developed polynomial-time heuristics and algorithms for practical solution.
L2O uses ML to optimize traditional optimization techniques.
problem Real-world optimization problems with shared structures.
method Exploiting shared structures to enhance optimization techniques.
result Better or faster solutions through machine learning integration.
Survey of DRO, a robust optimization framework.
problem Risk-aversion and chance-constrained optimization challenges.
method Distributionally robust optimization (DRO) framework.
result DRO's growing importance in operations research and statistics.
A novel neural network approach for optimization problems.
problem Constrained optimization problems.
method Neural Optimization Machine (NOM) using a specially designed NN architecture and training procedure.
result Solves optimization problems efficiently, especially in high-dimensional spaces.
Meta algorithm solves multivariate optimization using univariate optimizers.
problem Multivariate global optimization problems.
method Meta algorithm combining univariate global optimizers.
result Meta algorithm provides robust regret guarantees.
When hyperparameter optimization of a machine learning algorithm is repeated for multiple datasets it is possible to transfer knowledge to an optimization run on a new dataset. We develop a new hyperparameter-free ensemble model for Bayesian optimization that is a generalization of two existing transfer learning extens…
New algorithms ensure reproducibility and optimal convergence in convex optimization.
problem Trade-off between reproducibility and convergence rate in convex optimization.
method Regularization-based algorithms for smooth convex minimization and minimax optimization.
result Achieves optimal reproducibility and near-optimal gradient complexity for various oracle settings.
Proposes deep optimal feedback control for continuous-time systems with action constraints.
problem Learning optimal feedback control laws for robotic applications.
method Exploits Hamilton-Jacobi-Bellman equation and deep differential networks to learn optimal value function and feedback policy.
result Enables learning an optimal feedback control law that generates an optimal trajectory from any point in state-space without replanning.
Optimizes K-means clustering with PSO for better accuracy.
problem Improving the accuracy of K-means clustering.
method Uses Particle Swarm Optimization (PSO) to find optimal initial centroids for K-means.
result Optimal centroids found using PSO lead to better clustering accuracy.
Optimizes stochastic and online optimization methods based on problem geometry.
problem Optimizing computational and statistical outcomes in stochastic and online optimization problems.
method Characterizes optimal methods based on constraint set and gradient geometry.
result Stochastic and adaptive-gradient methods are optimal for quadratically convex constraint sets.
New algorithm selects robust martingale for optimal stopping problems.
problem Optimal stopping problems in stochastic processes.
method Randomized dual martingale minimization algorithm.
result Efficiently selects Doob martingale as close as possible.
Topological Bayesian Optimization finds optimal structures using topological data.
problem Optimizing complex structured data like material or neural network structures.
method Extract topological information from structures using persistent homology, apply Bayesian optimization with kernels for persistence diagrams.
result Topological information improves search efficiency for optimal structures.
Numerical optimization is an important tool in the field of computational physics in general and in nano-optics in specific. It has attracted attention with the increase in complexity of structures that can be realized with nowadays nano-fabrication technologies for which a rational design is no longer feasible. Also, …
This paper shows how to combine optimal tests into log-optimal processes.
problem How to combine optimal sequential tests into log-optimal processes.
method Using a new class of WAIT e-processes, the paper aggregates asymptotically optimal sequential tests into asymptotically log-optimal processes.
result It is possible to aggregate asymptotically optimal sequential tests into asymptotically log-optimal e-processes.
New algorithm AG-OG optimizes separable convex-concave problems efficiently.
problem Efficiently solving separable convex-concave minimax optimization problems.
method Leverages Nesterov acceleration and optimistic gradient on component and coupling parts of the problem.
result Achieves optimal convergence rate for various settings including bilinearly coupled problems.