Neural networks can learn Boolean circuits with local correlation.
problem Learning Boolean circuits with neural networks is computationally hard.
method Observing local correlation between input patterns and target labels, focusing on tree-structured Boolean circuits.
result Local correlation determines the success or failure of optimization in learning Boolean circuits.
Structured prediction is a powerful framework for coping with joint prediction of interacting outputs. A central difficulty in using this framework is that often the correct label dependence structure is unknown. At the same time, we would like to avoid an overly complex structure that will lead to intractable predicti…
Study evaluates capacity and trainability of parametrized quantum circuits.
problem Finding the best type of circuits for hybrid quantum-classical algorithms.
method Geometric structure of parameter space, effective quantum dimension, and circuit expressiveness.
result Identifies a transition in quantum geometry leading to decay of quantum natural gradient for deep circuits.
The paper tests if LLMs' capabilities are executed by small subnetworks (circuits).
problem Understanding how LLMs execute their capabilities.
method Formalized criteria for circuits, developed hypothesis tests, applied to six circuits.
result Synthetic circuits align with idealized properties, while Transformer circuits vary in their alignment.
The problem of learning tree-structured Gaussian graphical models from independent and identically distributed (i.i.d.) samples is considered. The influence of the tree structure and the parameters of the Gaussian distribution on the learning rate as the number of samples increases is discussed. Specifically, the error…
New tree structure for pseudo-Anosovs from interval maps.
problem Understanding pseudo-Anosovs from interval maps.
method Tree structure on pseudo-Anosovs using rational numbers.
result Deepened dictionary between invariants.
Study detects if a circuit bounds a disc using curve intersections.
problem Determining if a circuit bounds an embedded disc.
method Analyzing the group generated by Dehn twists about curves in a circuit.
result Cycle relation between Dehn twists detects disc-boundability.
Study a risk model with tree-structured Poisson-Markov random field for rainfall events.
problem Dependence between rainfall frequencies in insurance portfolios.
method Tree-structured Markov random field with Poisson marginals.
result Asymptotic results for portfolio risk and risk allocation.
Evolutionary strategy optimizes quantum circuit design and parameters.
problem Optimizing quantum circuit design and parameters for NISQ devices.
method Simple evolutionary strategy to optimize both circuit architecture and parameters.
result Minor slowdown on actual quantum hardware compared to simulations, with insights into mutation operations.
This work uses SVM to identify track component failures in AC Track Circuits.
problem Detecting and identifying specific track component failures in AC Track Circuits.
method Applied SVM classifier to STDS track circuit data.
result Successfully classified 15 different track component failures.
The statistical complexity of quantum circuits is studied using Rademacher complexity.
problem Measuring the richness of quantum hypothesis spaces.
method Applying Rademacher complexity to quantum circuits, investigating dependencies on resources, depth, width, and input/output registers.
result Bounds on the capacity of quantum neural networks constrained by circuit depth, width, and resource measures.
Quantum circuit Born machines are generative models which represent the probability distribution of classical dataset as quantum pure states. Computational complexity considerations of the quantum sampling problem suggest that the quantum circuits exhibit stronger expressibility compared to classical neural networks. O…
The study examines how quantum resources enhance the complexity of quantum circuits.
problem Quantum resource enhancement on circuit complexity.
method Utilizing quantum resource theories, the study analyzes statistical complexities of quantum circuits with limited quantum resources.
result Bounds for statistical complexities of quantum circuits are derived and applied to specific cases.
Quantum mechanics is inherently probabilistic in light of Born's rule. Using quantum circuits as probabilistic generative models for classical data exploits their superior expressibility and efficient direct sampling ability. However, training of quantum circuits can be more challenging compared to classical neural net…
Machine learning identifies key metabolic control circuits in bacterial pathways.
problem Identifying regulated metabolic pathways in bacteria.
method Machine learning approach analyzing multi-omics data.
result Identification of E. coli Glycolysis regulatory circuits.
A new approach uses circuit topology to study complex polymer interactions.
problem Understanding structural phase transitions in entangled polymer systems.
method Braided circuit topology framework for multiple-chain systems.
result Circuit topological motif fractions are effective order parameters for structural transitions.
Study bounds VAR model's circuit complexity, showing it's limited to TC^0 circuits.
problem Understanding the limitations of the Visual AutoRegressive model.
method Established circuit complexity bounds for the VAR model.
result VAR model is equivalent to a TC^0 threshold circuit with hidden dimension ≤ O(n).
End-to-end learning framework for tree-structured data.
problem Learning models struggle with tree-structured data due to lack of fixed-length vectors.
method Developed a novel framework for generic semantic tree-structured data of arbitrary topology.
result Framework yields comparable performance to standard models with dedicated feature-vectors and outperforms in compositional data.
Study shows limitations and possibilities of learning quantum circuit output distributions.
problem Learnability of output distributions of local quantum circuits.
method Investigated within two oracle models: statistical query model and direct sample access model.
result Output distributions of super-logarithmic depth Clifford circuits are not efficiently learnable in the statistical query model.
Quantum mechanics fundamentally forbids deterministic discrimination of quantum states and processes. However, the ability to optimally distinguish various classes of quantum data is an important primitive in quantum information science. In this work, we train near-term quantum circuits to classify data represented by …
We constructed an analog electrical circuit which generates fluctuations in which probability density function has power law tails. In the circuit fluctuations with an arbitrary exponent of the power law can be obtained by adjusting the resistance. With this low cost circuit the random fluctuations which have the simil…
Paper presents a new method for learning hyperbolic representations using tree structures.
problem Learning faithful low-dimensional hyperbolic embeddings of data.
method Metric-first approach to learn tree structure, then embed into hyperbolic manifold.
result Novel fast algorithm TreeRep learns tree approximating original metric.
Spin networks boost quantum algorithms solving SU(2) symmetric problems.
problem Efficiently solving SU(2) symmetric problems on quantum hardware.
method Using SU(2) equivariant variational quantum circuits based on spin networks.
result Spin networks provide a direct implementation for SU(2) equivariant quantum circuits.
Enhances quantum circuit synthesis using deep learning and geometric methods.
problem Optimizing quantum circuits for time efficiency.
method Combining deep learning with geometric control techniques.
result Improved time-optimal control in quantum circuit synthesis.
Single T-gate makes distribution learning hard for deep circuits.
problem Learning probability distributions from quantum circuits.
method Characterization of learnability and simulatability of quantum circuit outputs.
result Injection of a single T-gate into depth n^Ω(1) circuits makes distribution learning hard.
Paper develops data-driven compact models for diodes.
problem Manual and time-consuming compact model development.
method Machine Learning techniques for automation.
result Data-driven models accurately predict diode behavior.
We propose a neural information processing system which is obtained by re-purposing the function of a biological neural circuit model, to govern simulated and real-world control tasks. Inspired by the structure of the nervous system of the soil-worm, C. elegans, we introduce Neuronal Circuit Policies (NCPs), defined as…
Superconducting circuit technologies have recently achieved quantum protocols involving closed feedback loops. Quantum artificial intelligence and quantum machine learning are emerging fields inside quantum technologies which may enable quantum devices to acquire information from the outer world and improve themselves …
Quantum circuits are hard to learn on average.
problem Learning the output distributions of quantum circuits is hard.
method Statistical query model analysis.
result Learning quantum circuits requires exponentially many queries.
Study improves probabilistic circuits using transformations for better predictions.
problem Predictive limitations of probabilistic circuits in robotic scenarios.
method Integrates transformations into joint probability trees, extending their capabilities.
result Achieves higher likelihoods with fewer parameters on various data sets.
Quantum circuit optimization speeds up financial derivatives pricing.
problem Efficiently pricing financial derivatives on quantum computers.
method Pretraining conditional parameterized circuits for state-dependent functions.
result Quantum circuit implementation of derivatives' payoff function is more efficient.
Bayesian approach optimizes quantum circuits for noisy hardware.
problem Optimizing parameterized quantum circuits on noisy quantum hardware.
method Reformulate classical optimisation as Bayesian posterior, combining cost function and prior distribution. Apply dimension reduction and posterior sampling strategies.
result Bayesian approach generates faster, less noisy circuits than classical methods.
Paper tackles robust estimation of tree-structured Ising models without side information.
problem Learning tree-structured Ising models with flipped signs of variables.
method Proves unidentifiability, proposes an algorithm with logarithmic sample complexity and polynomial run-time complexity.
result Empirically demonstrates robustness of proposed algorithm in the flipped signs setting.
The paper uses tensor decompositions to improve neural network models for tree data.
problem Encoding structural knowledge from tree-structured data efficiently.
method Introduces new aggregation functions using Canonical and Tensor-Train decompositions.
result Proposed models outperform traditional methods on tree classification tasks.
The state-of-the-art machine learning approaches are based on classical von Neumann computing architectures and have been widely used in many industrial and academic domains. With the recent development of quantum computing, researchers and tech-giants have attempted new quantum circuits for machine learning tasks. How…
New method solves tree-structured Schrödinger Bridge problems.
problem Computing Schrödinger Bridge between tree-structured distributions.
method Iterative Markovian Fitting (IMF) procedure for tree-structured costs.
result Extends IMF to tree-structured Schrödinger Bridge problems.
Automatically designs analog circuits with deep learning.
problem Manual design of analog circuits is time-consuming and error-prone.
method Two-stage network with hypernetwork scheme and differential simulator.
result The method generates efficient and accurate circuit designs.
The lattice stick number sL(L) of a link L is defined to be the minimal number of straight line segments required to construct a stick presentation of L in the cubic lattice. Hong, No and Oh found a general upper bound sL(K)≤3c(K)+2. A rational link can be represented by a lattice presentation with exa…
Two proofs show that removing a loop from a plane circuit splits the plane.
problem Proving the Weak Jordan Theorem about plane circuits.
method Detailed presentation of Thomassen's and Filippov's proofs.
result The complement of any loop in a plane circuit is disconnected.
Quantum variational circuits improve reinforcement learning efficiency.
problem Improving reinforcement learning algorithms using quantum computing.
method Investigation of quantum variational circuits for DQN and Double DQN, encoding classical data for quantum circuits.
result Quantum variational circuits can solve reinforcement learning tasks with a smaller parameter space.
We define the beta diffusion tree, a random tree structure with a set of leaves that defines a collection of overlapping subsets of objects, known as a feature allocation. A generative process for the tree structure is defined in terms of particles (representing the objects) diffusing in some continuous space, analogou…
Develops a braid-theoretic framework to analyze chirality in molecular knots.
problem Analyzing chirality in molecular knots constructed using circuit topology.
method Translated circuit topology approach to knot engineering into braid-theoretic framework, calculating Jones polynomial for binary combinations.
result Jones polynomial provides a powerful tool for analyzing chirality of molecular knots.
Exact learning of tree-structured models with side info and noise.
problem Learning tree-structured graphical models with side information and noise.
method Probabilistic tools from strong large deviations theory.
result Exact asymptotics of structure learning from samples.
Improved Bayesian optimization for conditional parameter spaces.
problem Efficient global optimization of expensive-to-evaluate functions in conditional parameter spaces.
method Additive tree-structured covariance function for conditional parameter optimization.
result Significantly improved sample-efficiency and wider applicability compared to existing methods.
Unified tractability conditions for various compositional inference queries.
problem Analyzing tractability of probabilistic and causal inference queries.
method Algebraic perspective on circuits, focusing on semiring operators.
result Unified sufficient conditions for tractable composition of operators.
PNCs balance tractability and expressiveness in probabilistic modeling.
problem Balancing tractability and expressiveness in probabilistic models.
method Introduce probabilistic neural circuits (PNCs) as a mix of Bayesian networks and neural networks.
result PNCs are powerful function approximators.
Quantum circuits predict volatility dynamics preserving asymmetry.
problem Modeling volatility time series with asymmetry.
method Single-qubit quantum circuit learning (QCL) applied to synthetic data generated by Rational GARCH model.
result QCL-based predictions preserve negative return-volatility correlation and anti-persistent behavior.
Quantum circuits explained using Shapley values for better understanding.
problem Improving the explainability of quantum machine learning circuits.
method Applying Shapley values to quantify gate importance in quantum circuits.
result Quantum circuits can be explained by their gate importance, enhancing understanding and interpretability.