End-to-end deep learning boosts IM/DD fiber communication over dispersive channels.
problem Improving data transmission over dispersive IM/DD channels with memory.
method Bidirectional recurrent neural network (BRNN) for end-to-end deep learning of the communication system.
result End-to-end SBRNN achieves significant bit-error-rate reduction compared to FFNNs.
In this paper, we implement an optical fiber communication system as an end-to-end deep neural network, including the complete chain of transmitter, channel model, and receiver. This approach enables the optimization of the transceiver in a single end-to-end process. We illustrate the benefits of this method by applyin…
Suppose M is a non-compact connected n-manifold without boundary, DD(M) is the group of C^\infty-diffeomorphisms of M endowed with the Whitney C^\infty-topology and DD_0(M) is the identity connected component of DD(M), which is an open subgroup in the group DD_c(M) \subset DD(M) of compactly supported diffeomorphisms o…
Paper accelerates nonlinear mapping in online systems with lower time complexity.
problem Speeding up nonlinear mapping in online systems.
method Integrates an acceleration module into Dendrite Net (DD) to reduce time complexity.
result DD with AC has lower time complexity while maintaining nonlinear mapping and system identification properties.
We derive weighted log-Sobolev inequalities from a class of super Poincaré inequalities. As an application, the Talagrand inequality with larger distances are obtained. In particular, on a complete connected Riemannian manifold, we prove that the $\log^\dd$-Sobolev inequality with $\dd\in (1,2)$ implies the $L^{2/(2-\d…
DD-SP uses ML to improve SP for Lorenz 96 systems, outperforming LR and DD-P.
problem Improving computational efficiency in weather/climate modeling.
method Data-driven super-parameterization using recurrent neural networks.
result DD-SP is more accurate and cheaper than SP, especially with scale separation.
Analyzes double descent in binary classification models with different losses.
problem Understanding the double descent phenomenon in binary classification models.
method Analytic study of gradient descent with logistic and square losses on binary linear classification models.
result The double descent phenomenon persists but with differences compared to logistic loss.
DD algorithm tracks test error from train error without validation data.
problem Systematic generalization gap between train and test errors in modern model training.
method Decoupled descent (DD) algorithm that cancels data reuse biases via approximate message passing.
result DD algorithm rigorously demonstrates zero-cost validation and 100% data utilization.
Neural model detects DD risk in 5-year-olds, predicting 2 years ahead.
problem Early detection of developmental dyslexia for preventive teaching.
method Mixed neural model using auto-encoder and ordinal regression.
result System predicts DD risk 2 years before phonological processing is assessed.
PG-IM uses neural-symbolic programs to manipulate images.
problem Creating holistic image representations and manipulations.
method PG-IM detects patterns, induces symbolic programs, and manipulates images using a neural network.
result PG-IM learns from a single image and achieves superior performance.
DDS samples from noisy data by reversing diffusion, providing theoretical guarantees.
problem Sampling from unnormalized densities.
method Denoising diffusion process, score matching, optimal control, Schrödinger bridges.
result DDS provides theoretical guarantees for sampling.
Latent feature models are widely used to decompose data into a small number of components. Bayesian nonparametric variants of these models, which use the Indian buffet process (IBP) as a prior over latent features, allow the number of features to be determined from the data. We present a generalization of the IBP, the …
DD-VAE uses deterministic decoding for better latent code utilization in discrete data.
problem Inflexible decoders in VAEs lead to poor utilization of latent codes in discrete data.
method Proposed DD-VAE with deterministic decoding and new proposal distributions.
result DD-VAE improves latent code utilization and structure of learned manifold.
The IM effect helps detect anomalies by memorizing inliers early.
problem Challenges in fully unsupervised outlier detection.
method Theoretical study of a simple autoencoder, focusing on early training dynamics.
result Characterization of IM effect emergence, strength, and persistence.
For any triple (W,L,ρ), where W is a closed connected and oriented 3-manifold, L is a link in W and ρ is a flat principal B-bundle over W (B is the Borel subgroup of $SL(2,\mc)$), one constructs a $\Dd$-scissors congruence class $\cG_{\Dd}(W,L,ρ)$ which belongs to a (pre)-Bloch group $\Pp (\Dd)$. The class $\cG_{\D…
The purpose of this short paper is to further develop the theory of transverse generalized complex structures. We focus on proving some equivalent conditions to the basic ddJ -lemma. We justify our approach by describing the transverse symplectic structure in this language and relating the basic $dd^{\ma…
Double descent found in DRL, improving generalization with model capacity.
problem Generalization in over-parameterized DRL models.
method Actor-Critic framework, Policy Entropy metric.
result Policy Entropy significantly reduces as model capacity increases, indicating improved generalization.
New algorithm optimizes unimodal bandits using empirical divergence.
problem Optimizing decisions in multi-armed bandit problems with unimodal distributions.
method Indexed Minimum Empirical Divergence (IMED) adapted for unimodal structure.
result IMED-UB algorithm optimally exploits unimodal structure.
DDS uses a scorer to adaptively weigh data during training, improving model performance.
problem Efficiently optimizing data usage during machine learning training.
method Differentiable Data Selection (DDS) using a learnable scorer network and a reward signal.
result DDS delivers strong and consistent improvements over baselines on machine translation and image classification tasks.
SDD improves DD for estimating treatment effects by adjusting for confounding.
problem Estimating treatment effects in observational studies with confounding.
method Synthesized Difference in Differences (SDD) using RCT data to infer correct slopes.
result SDD achieves state-of-the-art performance across synthetic and real datasets.
Dead-Direction Signatures (DDS) provide a cheap, closed-form spectral reading of a network's singular complexity.
problem Estimating the complexity of deep networks through their loss singularities.
method DDS replaces the SGLD posterior chain with spectral linear algebra.
result DDS observables rank-track the network's singular complexity at the framework-predicted sign.
New strategies avoid forced exploration for unimodal bandits.
problem Optimal exploration of unimodal bandit problems.
method Adapting IMED strategy to unimodal structure without forced exploration.
result Proven optimal strategies for unimodal bandits.
Discussion of ``2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization'' by V. Koltchinskii [arXiv:0708.0083]
Discussion of ``2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization'' by V. Koltchinskii [arXiv:0708.0083]
Discussion of ``2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization'' by V. Koltchinskii [arXiv:0708.0083]
Discussion of ``2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization'' by V. Koltchinskii [arXiv:0708.0083]
Discussion of "2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization" by V. Koltchinskii [arXiv:0708.0083]
Improved UDA framework using f-divergence measures.
problem Addressing distribution shifts in machine learning.
method Refined f-divergence-based discrepancy and f-domain discrepancy. result Novel target error and sample complexity bounds.
We consider the problem of extending a conformal metric of negative curvature, given outside a neighbourhood of 0 in the unit disk $\DD$, to a conformal metric of negative curvature in $\DD$. We give conditions under which such an extension is possible, and also give obstructions to such an extension. The methods we us…
Paper presents a universal baseline for binary prediction models.
problem Need a robust baseline to evaluate model performance.
method Dutch Draw (DD) baseline method for binary classification models.
result Reduces to almost always predicting zero or one in most situations.
We produce examples of generalized complex structures on manifolds by generalizing results from symplectic and complex geometry. We produce generalized complex structures on symplectic fibrations over a generalized complex base. We study in some detail different invariant generalized complex structures on compact Lie g…
Let $-\im\Lie_\T$ (essentially Lie derivative with respect to $\T$, a smooth nowhere zero real vector field) and P be commuting differential operators, respectively of orders 1 and m≥1, the latter formally normal, both acting on sections of a vector bundle over a closed manifold. It is shown that if $P+(-i\Lie_…
Study complex manifolds with negative curvature, finding either a current or Kähler property.
problem Characterizing compact complex manifolds with negative curvature operators.
method Proves properties using metrics and the pluriclosed flow.
result Classification of complex surfaces with negative curvature operators.
A multiple classifiers fusion localization technique using received signal strengths (RSSs) of visible light is proposed, in which the proposed system transmits different intensity modulated sinusoidal signals by LEDs and the signals received by a Photo Diode (PD) placed at various grid points. First, we obtain some {\…
Survey examines distillation methods for large language models.
problem Efficiently compress large language models while preserving their capabilities.
method Knowledge Distillation and Dataset Distillation techniques.
result Integrating KD and DD can produce more effective and scalable compression strategies.
A new framework maximizes influence spread in social networks by accounting for inter-community diffusion.
problem Real-world social networks have inter-community influence that is often overlooked in community-based IM approaches.
method Community-IM++ uses a heuristic based on community-based diffusion degree and progressive budgeting to model and prioritize cross-community diffusion.
result Community-IM++ achieves near-greedy influence spread at up to 100 times lower runtime than existing methods.
Proposes EDESH-SA for better inventory management under uncertainty.
problem Inventory management under uncertainty.
method Ensemble Differential Evolution with simulation-based hybridization and self-adaptation.
result Improves financial performance and optimizes search spaces.
The rise of Online Social Networks (OSNs) has caused an insurmountable amount of interest from advertisers and researchers seeking to monopolize on its features. Researchers aim to develop strategies for determining how information is propagated among users within an OSN that is captured by diffusion or influence model…
Study of Monge-Ampère volumes on hermitian manifolds, focusing on plurisigned metrics.
problem Behavior of Monge-Ampère volumes under hermitian variations.
method Analysis of hermitian forms and cohomology, studying boundedness and positivity.
result Existence and non-existence of plurisigned hermitian metrics on specific manifolds.
Paper tackles adapting multiple domains to a target domain using distillation and dictionary learning.
problem Adapting multiple heterogeneous labeled source domains to an unlabeled target domain.
method Combines Multi-Source Domain Adaptation and Dataset Distillation with Dataset Dictionary Learning.
result Achieves state-of-the-art adaptation performance even with minimal labeled data.
Language models perform worse with implicit reward models than explicit ones.
problem Understanding why implicit reward models generalize worse than explicit ones.
method Investigated the root cause of the generalization gap between IM-RMs and EX-RMs.
result Implicit reward models rely more on superficial token-level cues, leading to worse generalization.
New method recovers relative rates in spatial compositional data from IMS.
problem Challenges in analyzing spatial data from IMS due to competitive sampling.
method Hierarchical Variational Graph Fused Lasso using heavy-tailed graphical lasso prior and automatic differentiation variational inference.
result Our method outperforms state-of-the-practice point estimate methodologies in IMS and has superior posterior coverage.
Optimized strategies for graph-structured bandits reduce regret efficiently.
problem Structured multi-armed bandit problem with graph constraints.
method Adapted IMED algorithm to graph-structured bandits, introducing IMED-GS⋆. result IMED-GS⋆ is asymptotically optimal and requires minimal exploration. A locally conformally Kahler (LCK) manifold is a complex manifold with a Kahler structure on its covering and the deck transform group acting on it by holomorphic homotheties. One could think of an LCK manifold as of a complex manifold with a Kahler form taking values in a local system L, called the conformal weight …
Prove existence of SO(3)imesSO(8)-invariant Einstein metric on S3imesS7
problem Prove existence of SO(3)imesSO(8)-invariant Einstein metric on S3imesS7 method Prove existence of SO(3)imesSO(8)-invariant Einstein metric on S3imesS7 result Prove existence of SO(3)imesSO(8)-invariant Einstein metric on S3imesS7 The paper calculates the dimension of the image of the Abel map for normal surface singularities.
problem Calculating the dimension of the image of the Abel map for normal surface singularities.
method Provides combinatorial formulae for the dimension of the image of the Abel map.
result Combinatorial formulae for the dimension of the image of the Abel map.
The well-known Influence Maximization (IM) problem has been actively studied by researchers over the past decade, with emphasis on marketing and social networks. Existing research have obtained solutions to the IM problem by obtaining the influence spread and utilizing the property of submodularity. This paper is based…
Starting from a sequence of independent Wright-Fisher diffusion processes on [0,1], we construct a class of reversible infinite dimensional diffusion processes on $\DD_\infty:= \{{\bf x}\in Let $MbeacompleteRiemnnianmanifoldandμthedistributionofthediffusionprocessgeneratedby\ff 1 2\DD+ZwhereZ$…