Optimizes privacy-preserving data release with adversarial neural networks.
problem Minimizing distortion while concealing sensitive information in data release.
method Adversarial neural networks for randomized mechanisms and variational approximation of mutual information privacy.
result Achieves near-optimal tradeoffs between data distortion and privacy in experiments.
Paper addresses FL over MAC with DP constraints, proposing a novel consensus scheme.
problem Federated learning over a multiple access channel with differential privacy constraints.
method Proposes a novel consensus scheme using digital distributed stochastic gradient descent (D-DSGD) with artificial noise to preserve DP.
result Demonstrates improved convergence rate and DP level for a given MAC capacity.
The study uses machine learning to model semantic drift in digital content.
problem Detecting and measuring semantic drift in evolving digital content.
method Employing machine learning algorithms on a dataset of Tate Galleries metadata.
result Semantic drift can be modeled using a metaphor of social mechanics.
Study assesses impact of CBDC on financial stability in dual-currency economy.
problem Impact of CBDC on financial stability in dual-currency economy (Romania).
method Integrated analytical framework combining econometrics, machine learning, and behavioural modelling. CBDC adoption probabilities estimated using XGBoost and logistic regression models. Liquidity stress simulations and VAR, MSVAR, SVAR models capture macro-financial transmission.
result CBDC uptake would be moderate, primarily driven by digital readiness and trust in the central bank.
Proposes TTNPE for tensor data embedding with improved trade-offs.
problem Embedding multi-dimensional tensor data into low dimensions.
method Tensor Train Neighborhood Preserving Embedding (TTNPE) with novel optimization approaches.
result Improves classification, computation, and dimensionality reduction trade-offs.
This study redefines probability for finite outcomes using axioms and examples.
problem Defining probability for finite outcomes and preserving information.
method Developed three axioms for relative probability functions and provided examples and a system for their composition.
result Proved the topological closure of the relative probability space, preserving information under limits.
GANs help create realistic synthetic health data, boosting medical research.
problem Challenges in creating realistic synthetic health data due to private patient data.
method Generative Adversarial Networks (GANs) to learn and produce synthetic health data.
result GANs can produce realistic synthetic health data, overcoming challenges in OHD.
Paper develops a private CDBN for differential privacy in medical data.
problem Privacy issues in deep learning models trained on sensitive medical data.
method Enforces epsilon-differential privacy on CDBNs using Chebyshev expansion and functional mechanism.
result Preserving differential privacy in CDBNs is feasible and effective.
A monitoring procedure improves machine learning forecasts for digital platforms.
problem Maintaining accurate and stable forecasts for data streams at digital platforms.
method Developed a monitoring procedure to determine when to retrain machine learning algorithms.
result Monitor-based retraining produces accurate forecasts compared to benchmarks.
Paper extends LfC to distributed learning with asynchronous optimization.
problem Learning from constraints in a distributed, nonconvex setting.
method Applying asynchronous Method of Multipliers to Learning from Constraints.
result Demonstrates privacy-preserving distributed learning with local constraints.
Digital money could reduce germ spread during coronavirus.
problem Spreading of germs via paper money during coronavirus.
method Policy recommendations for mobile wallets, digital currencies, and data protection.
result Adopting digital money can help reduce germ spread.
DP-CGAN generates private synthetic data and labels.
problem Preserving privacy in synthetic data generation.
method Differentially private conditional GAN (DP-CGAN) with clipping and perturbation.
result DP-CGAN generates visually and empirically promising results on MNIST with low privacy cost.
Improved fraud detection in finance with quantum-enhanced federated learning.
problem Challenges in detecting financial fraud with traditional methods.
method Hybrid quantum-enhanced federated learning framework combining quantum LSTM with privacy-preserving techniques.
result Approximately 5% improvement in performance metrics compared to conventional models.
Study of digital topology concepts like hyperspaces and function graphs.
problem Adapting classical topology concepts to digital topology.
method Define digital hyperspaces and function graphs, study their properties.
result Some relationships and graphical properties of digital hyperspaces and function graphs.
Framework corrects model form errors in structural dynamics predictions.
problem Model form errors in parametric models of structural dynamics.
method Gaussian Process Latent Force Model (GPLFM) for non-parametric discrepancy representation, linear Bayesian filtering for state and discrepancy estimation, modal reduction for computational tractability.
result Significant reduction of displacement and rotation prediction errors under unseen excitations.
Corrects a false claim about a digital sphere model's contractibility.
problem Incorrect claim about MSS_18's 18-contractibility.
method Analyzes digital image MSS_18 as a digital model of S^2.
result Shows MSS_18 is 18-contractible.
Study shy maps in digital topology.
problem Properties of shy maps in digital topology.
method Study properties of shy maps.
result Properties of shy maps in digital topology.
The paper highlights issues with fixed point claims in digital images.
problem Flaws in published assertions about fixed points in digital images.
method Continues a series of studies examining digital topology.
result Identifies and discusses problems with fixed point claims.
Find limiting sets for digital cones and suspensions.
problem Digital topology cone and suspension constructions.
method Identify (m, n)-limiting sets, especially (0, 0)-freezing sets.
result Discover (0, 0)-limiting sets for digital cones and suspensions.
Corrects incorrect assertions about fixed points in digital topology.
problem Incorrect or incorrectly proven assertions about fixed points in digital metric spaces.
method Analysis of existing assertions and proofs.
result Identifies and corrects errors in published assertions.
Study AFPP of unions of convex digital disks in 2D.
problem Conditions for AFPP of union of convex disks in digital plane.
method Use results from [6] to analyze AFPP.
result Conditions for AFPP of union of convex disks.
The paper addresses flaws in fixed point assertions for digital images.
problem Deficiencies in previously published works on fixed point assertions for digital images.
method Continues a series of studies to identify and rectify issues in fixed point assertions.
result Identifies and corrects flaws in fixed point assertions for digital images.
Study minimal freezing sets in convex digital disks.
problem Finding minimal freezing sets in convex digital disks.
method Showed how to find minimal freezing sets for convex disks in digital plane.
result Found minimal freezing sets for convex disks in digital plane.
The paper constructs graph models for n-dimensional manifolds.
problem Creating digital models of n-dimensional manifolds.
method Constructing graph models using LCL collections of n-cells.
result Digital models retain topological properties of continuous manifolds.
Study on cold and freezing sets in digital images.
problem Properties of cold sets in digital images.
method Analysis of properties and relationships between cold and freezing sets.
result Examined relationships between cold and freezing sets.
Incorrect fixed point assertions in digital topology are discussed.
problem Incorrect or poorly stated fixed point assertions in digital topology.
method Discussion of problematic publications in digital metric spaces.
result Clarification of incorrect fixed point assertions.
Incorrect fixed point assertions in digital topology are discussed.
problem Incorrect, incorrectly proven, or trivial fixed point assertions in digital topology.
method Continues earlier work on identifying and critiquing bad fixed point assertions.
result Clarifies the nature and extent of incorrect fixed point assertions in digital topology.
Digital trees have approximate fixed point property, and conditions for products are explored.
problem Conditions for the approximate fixed point property in digital tree products.
method Analyzes digital trees and their products, explores conditions for the AFPP.
result Conditions are found for the AFPP in digital tree products.
Subspace clustering methods based on ℓ1, ℓ2 or nuclear norm regularization have become very popular due to their simplicity, theoretical guarantees and empirical success. However, the choice of the regularizer can greatly impact both theory and practice. For instance, ℓ1 regularization is guaranteed t…
Study convexity and AFPP in digital images.
problem Relationship between convexity and AFPP in digital images.
method Examined in Z^2 digital images.
result Relationship between convexity and AFPP in digital images.
The study examines properties of digital images using various adjacencies.
problem Properties of Cartesian products of digital images.
method Various adjacencies used to study digital images.
result Properties of digital images studied using adjacencies.
The paper highlights issues in fixed point claims in digital topology.
problem Flaws in published assertions about fixed points in digital metric spaces.
method Continues a series of studies examining these flaws.
result Identifies and discusses problems in fixed point claims.
Han discusses variants of digital covering maps and their equivalences.
problem Han's paper lacks thorough discussion on variants and their equivalences.
method Examined several variants of digital covering maps and compared their equivalences.
result Found several equivalences among the variants of digital covering maps.
Method discovers symmetries in data with neural networks.
problem Discovering symmetries in high-dimensional data.
method Fully connected neural networks trained with a loss function for symmetry.
result Generators for symmetries in latent space.
Shy maps preserve path-connectedness in continuous functions.
problem Understanding properties of continuous functions in topological spaces.
method Defining shy maps as continuous functions with specific path-connected inverse images.
result Every shy map onto a semilocally simply connected space induces a surjection of fundamental groups.
Critiques incorrect fixed point assertions in digital topology.
problem Incorrect or incorrectly proven fixed point assertions in digital topology.
method Critical review of existing assertions.
result Identifies and critiques incorrect fixed point assertions.
Examines how irreducibility and rigidity affect digital images.
problem Understanding interactions between irreducibility and rigidity in digital images.
method Analyzes Cartesian products, wedges, and cold and freezing sets.
result Interactions between irreducibility and rigidity in digital images.
Study restrictions on digitally continuous functions and their effects.
problem Understanding effects of restrictions on digitally continuous functions.
method Analyzing digitally continuous functions and their modifications.
result Analogous result for topological spaces derived from digitally continuous functions.
Fixed point assertions in digital topology are often incorrect or poorly stated.
problem Fixed points in digital metric spaces
method Discussing publications with bad assertions
result Identifying and correcting errors in fixed point assertions
A new method streamlines digital payment programming using smart contracts.
problem High costs and security challenges in programming smart contracts for digital payments.
method Transforming digital currencies into token streams and using configurable templates to generate specialized smart contracts.
result Reduces payment programming costs and enhances security, self-enforcement, adaptability, and controllability.
New framework explains leading digit patterns without probabilistic assumptions.
problem Explaining leading digit distributions without relying on probabilistic models.
method Shift-invariant functional equation and affine-plus-periodic formulas.
result Unified mathematical foundation for understanding digit distributions.
Study freezing sets for digital images in a 2D grid.
problem Determine minimal freezing sets for digital images.
method Prove methods to obtain freezing sets for digital images (X, c_i) where X is a subset of Z^2.
result Examples show how methods can lead to the determination of minimal freezing sets.
Study examines risk of digital currencies using GARCH and Filtered Historical Simulation.
problem Risk management of digital currencies like Bitcoin, Ethereum, Litecoin, and Ripple.
method GARCH modelling followed by Filtered Historical Simulation.
result Digital currencies are subject to higher risk, requiring higher buffer and risk capital.
Paper presents a lightweight, unobtrusive method to protect edge device data privacy.
problem Protecting inference data privacy in IoT edge devices with limited compute power.
method A lightweight neural network at edge devices to obfuscate inference data without indicating obfuscation.
result Effectively protects inference data confidentiality while preserving backend accuracy.
Pakistan examines digital mergers using traditional competition tools.
problem Regulating digital mergers in a developing country.
method Empirical comparative analysis of CCP's M&A decisions.
result CCP uses same decision factors for digital and traditional M&As.
Adaptive Multilevel Splitting improves rare event pricing for financial derivatives.
problem Efficient pricing of binary options in rare event regimes with discontinuous payoffs.
method Adaptive Multilevel Splitting (AMS) reformulates rare-event problem as conditional events.
result AMS achieves up to 200-fold improvements over standard Monte Carlo, preserving unbiasedness.
Wrist movements can reveal digits, posing security risks.
problem Security vulnerabilities in wrist wearable devices.
method Machine learning model trained on wrist movement data.
result 100% accuracy in predicting digits via wrist movement.
Generative models create personalized patient health simulations.
problem Creating accurate digital twins for personalized medicine.
method Neural network architecture for conditional generative models of clinical trajectories.
result Same architecture generates accurate twins across 13 indications.