https://doi.org/10.26089/NumMet.v27r436

Electric currents for discrete data generation

Authors

  • Alexander S. Kolesov
  • Stepan I. Manukhov
  • Vladimir V. Palyulin
  • Alexander A. Korotin

Keywords:

discrete data generation
electric currents
probability flow
distribution transfer

Abstract

In this paper, we propose a new method for data generation in discrete settings called Electric Current Discrete Data Generation (ECD2G). The method establishes an analogy between electric current flow in a circuit and the transfer of probability mass between data distributions. Samples from the source distribution are treated as current input nodes of a circuit, while samples from the target distribution are interpreted as current output nodes. A neural network is used to learn the distribution of electric currents describing the probability flows in the circuit. To map the source distribution to the target one, source samples are transferred through the circuit pathways according to the learned currents. This process ensures the transfer between data distributions without loss of probability in the exact circuit construction. The results of numerical computational experiments are presented to illustrate applicability and effectiveness of the proposed ECD2G method.



Downloads

Published

2026-10-05

Issue

Section

Methods and algorithms of computational mathematics and their applications

Authors

Alexander S. Kolesov

Skolkovo Institute of Science and Technology

• PhD Student, researcher

Stepan I. Manukhov

Vladimir V. Palyulin

Alexander A. Korotin


References

  1. J. Sohl-Dickstein, E. A. Weiss, N. Maheswaranathan, and S. Ganguli, “Deep Unsupervised Learning Using Nonequilibrium Thermodynamics,” in Proceedings of the 32nd International Conference on Machine Learning (ICML-15), Lille, France, July 6–11, 2015(JMLR: W&CP, Vol. 37, 2015), pp. 2256–2265.
    doi 10.48550/arXiv.1503.03585
  2. J. Ho, A. Jain, and P. Abbeel, “Denoising Diffusion Probabilistic Models,” Advances in Neural Information Processing Systems 33, 6840–6851 (2020).
    doi 10.48550/arXiv.2006.11239
  3. Y. Song and D. P. Kingma, “How to Train Your Energy-Based Models,” arXiv:2101.03288 (2021).
    doi 10.48550/arXiv.2101.03288
  4. P. Dhariwal and A. Nichol, “Diffusion Models Beat GANs on Image Synthesis,” Advances in Neural Information Processing Systems 34, 8780–8794 (2021).
    doi 10.48550/arXiv.2105.05233
  5. J. Austin, D. D. Johnson, J. Ho, et al., “Structured Denoising Diffusion Models in Discrete State-Spaces,” Advances in Neural Information Processing Systems 34, 17981–17993 (2021).
    doi 10.48550/arXiv.2107.03006
  6. A. Lou, C. Meng, and S. Ermon, “Discrete Diffusion Modeling by Estimating the Ratios of the Data Distribution,” in Proceedings of the 41st International Conference on Machine Learning (ICML 2024), Vienna, Austria, July 21–27, 2024(PMLR, Vol. 235, 2024), pp. 32819–32848.
    doi 10.48550/arXiv.2310.16834
  7. S. S. Sahoo, M. Arriola, Y. Schiff, et al., “Simple and Effective Masked Diffusion Language Models,” Advances in Neural Information Processing Systems 37, 130136–130184 (2024).
    doi 10.52202/079017-4135
  8. X. Zhang and Q. Zhang, “DDMG: A New Discrete Diffusion Model Developed for Molecular Graph Generation,” in 6th International Conference on Computer Engineering and Application (ICCEA), Hangzhou, China, April 25–27, 2025(IEEE, 2025), pp. 1489–1493.
    doi 10.1109/ICCEA65460.2025.11102178
  9. Y. Xu, Z. Liu, M. Tegmark, and T. Jaakkola, “Poisson Flow Generative Models,” Advances in Neural Information Processing Systems 35, 16782–16795 (2022).
    doi 10.48550/arXiv.2209.11178
  10. Y. Xu, Z. Liu, Y. Tian, et al., “PFGM++: Unlocking the Potential of Physics-Inspired Generative Models,” in Proceedings of the 40th International Conference on Machine Learning (ICML), Honolulu, Hawaii, USA, July 23–29, 2023(PMLR, 2023), pp. 38566–38591.
    doi 10.48550/arXiv.2302.04265
  11. A. Kolesov, S. I. Manukhov, V. V. Palyulin, and A. Korotin, “Field Matching: An Electrostatic Paradigm to Generate and Transfer Data,” in Proceedings of the Forty-second International Conference on Machine Learning, Vancouver, Canada, July 13–19, 2025(PMLR, Vol. 267, 2025), pp. 31202–31222.
    doi 10.48550/arXiv.2502.02367
  12. S. I. Manukhov, A. Kolesov, V. V. Palyulin, and A. Korotin, “Interaction Field Matching: Overcoming Limitations of Electrostatic Models,” arXiv:2506.02950 (2025).
    doi 10.48550/arXiv.2506.02950
  13. W. K. Chen, The Electrical Engineering Handbook (Elsevier, 2004).
    https://shop.elsevier.com/books/the-electrical-engineering-handbook/chen/978-0-12-170960-0 Cited September 28, 2026.
  14. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, 1993).
  15. C. M. Grinstead and J. L. Snell, Introduction to Probability (American Mathematical Society, 1997).
  16. J. G. Kemeny and J. L. Snell, Finite Markov Chains (Van Nostrand, Princeton, N.J, 1960).
  17. E. S. Whitammer, S. Lahlou, T. Deleu, et al., “GFlowNets and Variational Inference,” arxiv:2210.00580 (2022).
    doi 10.48550/arXiv.2210.00580
  18. I. Gat, T. Remez, N. Shaul, et al., “Discrete Flow Matching,” Advances in Neural Information Processing Systems 37, 133345–133385 (2024).
    doi 10.52202/079017-4239
  19. E. Hoogeboom, D. Nielsen, P. Jaini, et al., “Argmax Flows and Multinomial Diffusion: Learning Categorical Distributions,” Advances in Neural Information Processing Systems 34, 12454–12465 (2021).
    doi 10.48550/arXiv.2102.05379
  20. G. Ryzhakov, S. Pavlova, E. Sevriugov, and I. Oseledets, “Explicit Flow Matching: On the Theory of Flow Matching Algorithms with Applications,” arXiv:2402.03232 (2024).
    doi 10.48550/arXiv.2402.03232
  21. A. Gretton, K. M. Borgwardt, M. J. Rasch, et al., “A Kernel Two-Sample Test,” Journal of Machine Learning Research 13, 723–773 (2012).
    https://jmlr.org/papers/v13/gretton12a.html Cited September 29, 2026.
  22. A. Campbell, J. Benton, V. De Bortoli, et al., “A Continuous Time Framework for Discrete Denoising Models,” Advances in Neural Information Processing Systems 35, 28266–28279 (2022).
    doi 10.48550/arXiv.2205.14987