A deep learning approach generates math word problems in multiple languages.
problem Template-based mechanisms for generating mathematical word problems lack customizability and creativity.
method Character Level Long Short Term Memory Network (LSTM) and POS tags are used to generate and resolve constraints in generated problems.
result The approach generates accurate math word problems in English and Sinhala with over 90% accuracy.
Graph clustering method uses templates to match vertices and outperforms classical methods.
problem Graph clustering with additional structural information.
method Formulates graph clustering as template matching, using orthonormal matrices for embedding.
result Method outperforms classical methods, especially for challenging cases.
In this paper, we address the problem of data reconstruction from privacy-protected templates, based on recent concept of sparse ternary coding with ambiguization (STCA). The STCA is a generalization of randomization techniques which includes random projections, lossy quantization, and addition of ambiguization noise t…
We present MILABOT: a deep reinforcement learning chatbot developed by the Montreal Institute for Learning Algorithms (MILA) for the Amazon Alexa Prize competition. MILABOT is capable of conversing with humans on popular small talk topics through both speech and text. The system consists of an ensemble of natural langu…
We present MILABOT: a deep reinforcement learning chatbot developed by the Montreal Institute for Learning Algorithms (MILA) for the Amazon Alexa Prize competition. MILABOT is capable of conversing with humans on popular small talk topics through both speech and text. The system consists of an ensemble of natural langu…
Improves MRI-based brain surface reconstruction with minimal deformation energy loss.
problem Ensuring optimal deformation energy and consistency in learning-based cortical surface reconstruction.
method Design and implementation of a Minimal Energy Deformation (MED) loss in the V2C-Flow model.
result Significant improvements in training consistency and reproducibility without sacrificing reconstruction accuracy and topological correctness.
Current Flash X-ray single-particle diffraction Imaging (FXI) experiments, which operate on modern X-ray Free Electron Lasers (XFELs), can record millions of interpretable diffraction patterns from individual biomolecules per day. Due to the stochastic nature of the XFELs, those patterns will to a varying degree includ…
METRO predicts reactions using minimal templates, reducing computational overhead and achieving state-of-the-art results.
problem Predicting possible reaction substrates for complex molecules from simpler precursors.
method METRO (Molecule-Edit Templates for RetrOsynthesis) uses minimal templates to predict reactions efficiently and accurately.
result METRO achieves state-of-the-art results on standard benchmarks, reducing computational overhead.
Labeling training data is one of the most costly bottlenecks in developing machine learning-based applications. We present a first-of-its-kind study showing how existing knowledge resources from across an organization can be used as weak supervision in order to bring development time and cost down by an order of magnit…
The prediction of organic reaction outcomes is a fundamental problem in computational chemistry. Since a reaction may involve hundreds of atoms, fully exploring the space of possible transformations is intractable. The current solution utilizes reaction templates to limit the space, but it suffers from coverage and eff…
Hopfield networks improve reaction template prediction for few/zero-shot scenarios.
problem Predicting reaction templates for new molecules in CASP.
method Adapted Hopfield networks to associate reaction templates, molecules, and structural information.
result Significantly improved performance for templates with few or zero training examples.
KG-A2C agent learns natural language IF games by reasoning and constraining action spaces.
problem Challenges of natural language understanding, partial observability, and combinatorially large action spaces in IF games.
method Builds a dynamic knowledge graph while exploring, constraining actions using templates.
result Outperforms current IF agents across various games with larger action spaces.
Paper introduces a graph-based approach for retrosynthesis prediction.
problem Predicting precursor molecules for target molecules in organic synthesis.
method Graph-based approach that predicts graph edits and synthons expansion.
result Achieves top-1 accuracy of 53.7%.
New model predicts chemical reactions with conditional graph logic networks.
problem Predicting chemical reactions for synthesizing molecules.
method Conditional Graph Logic Network (CGLN) based on graph neural networks.
result Significant improvement of 8.1% over state-of-the-art methods.
G2Gs transforms target molecules into reactants without templates, improving accuracy.
problem Predicting retrosynthesis from target molecules efficiently and accurately.
method Transforming target molecular graphs into reactant graphs via variational graph translation.
result G2Gs achieves top-1 accuracy close to state-of-the-art template-based methods.
The study designs inherently interpretable machine learning models for high-risk sectors.
problem The need for transparent and explainable machine learning models in regulated industries.
method Qualitative template based on feature effects and model architecture constraints for assessing inherent interpretability.
result Demonstrates the design and evaluation of an interpretable ReLU DNN model for predicting credit default.
Proposes a new framework for investing that adapts to market regimes.
problem Adapting to dynamic market regimes for better investment performance.
method Wasserstein Hidden Markov Model (HMM) with transaction-cost-aware optimization.
result Significantly higher risk-adjusted performance compared to benchmarks.
Study shows how transformers classify symbols without naming them, proving a margin-versus-collision criterion.
problem How transformers classify symbols without naming them.
method Logistic classification analysis of transformer-kernel regime, colored collision graph.
result Decomposes learned predictor into ideal template-level classifier and finite-sample perturbation.
Recently exciting progress has been made on protein contact prediction, but the predicted contacts for proteins without many sequence homologs is still of low quality and not very useful for de novo structure prediction. This paper presents a new deep learning method that predicts contacts by integrating both evolution…
In this paper we study dynamic pricing mechanisms of financial derivatives. A typical model of such pricing mechanism is the so-called g--expectation defined by solutions of a backward stochastic differential equation with g as its generating function. Black-Scholes pricing model is a special linear case of this pricin…
A solution for the Weinstein's Problem in the general framework of generalized Lie algebroids is the target of this paper. We present the mechanical systems called by use, mechanical (?; ?)-systems, Lagrange mechanical (?; ?)-systems or Finsler mechanical (?; ?)-systems and we develop their geometries. We obtain the ca…
New mechanics on non-associative octonions discovered.
problem Discrete mechanics on non-associative groups.
method Generalized Lagrangian and Hamiltonian mechanics to non-associative objects.
result Discrete mechanics on unitary octonions achieved.
A new description, different by the classical theory of Hamiltonian Mechanics, in the general framework of generalized Lie algebroids is presented. In the particular case of Lie algebroids, new and important results are obtained. We present the \emph{dual mechanical systems} called by use, \emph{dual mechanical}$(ρ,η) …
This paper assesses Gaussian and Exponential mechanisms for certifying adversarial robustness.
problem Certifying adversarial robustness using randomized smoothing mechanisms.
method Proposes a generic framework to assess the appropriateness of randomized smoothing mechanisms.
result Gaussian mechanism is an appropriate option for certifying both ℓ2-norm and ℓ∞-norm robustness. We propose a new input perturbation mechanism for publishing a covariance matrix to achieve (ε,0)-differential privacy. Our mechanism uses a Wishart distribution to generate matrix noise. In particular, We apply this mechanism to principal component analysis. Our mechanism is able to keep the positive semi-definitene…
New mechanisms improve differential privacy for scalar queries.
problem Improving differential privacy for scalar, real-valued query functions.
method Mixing multiple Gaussian distributions to satisfy differential privacy.
result Mechanisms yield lower noise amplitudes and variances compared to the analytic Gaussian mechanism.
We design two mechanisms for the recommender system to collect user ratings. One is modified Laplace mechanism, and the other is randomized response mechanism. We prove that they are both differentially private and preserve the data utility.
Quantum mechanics models for financial Black-Scholes model.
problem Modeling financial derivatives using quantum mechanics.
method Noncommutative quantum mechanics applied to specific mechanical systems.
result Generalized noncommutative quantum mechanics of financial models.
Expands differential privacy mechanisms to include the Generalized Gaussian mechanism for improved private machine learning.
problem Improving privacy in machine learning algorithms while maintaining utility.
method Introduces and analyzes the Generalized Gaussian (GG) mechanism for differential privacy.
result The GG mechanism provides better performance than the Laplace and Gaussian mechanisms across various values of β.
Differential privacy mechanism design has traditionally been tailored for a scalar-valued query function. Although many mechanisms such as the Laplace and Gaussian mechanisms can be extended to a matrix-valued query function by adding i.i.d. noise to each element of the matrix, this method is often suboptimal as it for…
Optimal DP mechanisms for vector queries are found to be staircase distributions.
problem Designing optimal additive mechanisms for vector-valued queries under differential privacy.
method Reduction to radially symmetric distributions and convex rearrangement theory.
result Staircase mechanisms are optimal for any norm and cost function.
New approach identifies latent properties from mechanisms, not just data.
problem Identifying latent properties from data generating processes.
method Equivariance perspective on identifiable representation learning.
result Identification of latent properties is possible up to shared equivariances in known mechanisms.
New RL approach learns dynamic VCG mechanisms in unknown MDP environments.
problem Learning dynamic VCG mechanisms in unknown MDP environments.
method Reward-free online RL for exploration, combined with function approximation.
result Regret bound of O~(T2/3) for dynamic VCG mechanism learning. Paper connects dynamics of mechanical systems to Reeb dynamics.
problem Understanding dynamics in mechanical systems with Poisson structures.
method Using Jacobi bundle metrics and linear Poisson structures.
result Extends classical results on Reeb dynamics to mechanical systems.
Exact discrete mechanics for nonholonomic systems defined.
problem Discrete mechanics for nonholonomic systems.
method Constructing an exponential map and deriving exact discrete nonholonomic integrators.
result Reproduces continuous nonholonomic flow as discrete flow on constraint submanifold.
A new Gaussian mechanism for differential privacy in the shuffle model is introduced.
problem Improving differential privacy in distributed learning environments.
method Characterization and upper-bounding of Rényi differential privacy (RDP) for the shuffle Gaussian mechanism.
result The shuffle Gaussian mechanism provides improved privacy guarantees compared to existing methods.
Active-memory mechanisms can replace self-attention in Transformers, but optimal results often require both.
problem Replacing self-attention with active-memory mechanisms in Transformers.
method Evaluation of various active-memory mechanisms in a Transformer model.
result Active-memory mechanisms can achieve comparable results to self-attention for language modeling, but optimal results are often achieved by combining both mechanisms.
We study the problem of what causes prices to change. We define the mechanical impact of a trading order as the change in future prices in the absence of any future changes in decision making, and its it informational impact as the remainder of the total impact once mechanical impact is removed. We introduce a method o…
New mechanism for pure differential privacy on functional summaries using Laplace-like process.
problem Challenges in achieving differential privacy for complex, structured functional summaries.
method Independent Component Laplace Process (ICLP) mechanism for infinite-dimensional Hilbert space.
result Effective enhancement of utility of private summaries through oversmoothing.
Unified framework for subsampling mechanisms with tighter privacy guarantees.
problem Improving privacy in machine learning models through subsampling.
method Conditional optimal transport for deriving mechanism-specific subsampling guarantees.
result Tighter privacy bounds for subsampled mechanisms compared to traditional methods.
New geometric mechanism solves four envelope problems.
problem Four basic problems on envelopes created by hyperplane families.
method Simple geometric mechanism of intersections of perpendicular bisectors and normal lines.
result Solves all four basic problems on envelopes at once.
A flexible machine learning model infers the morphology of the Galactic Center Excess.
problem Inferring the unknown morphology of the Galactic Center Excess using Fermi gamma-ray data.
method Used a Gaussian process (GP) to model the Galactic Center Excess (GCE) as a flexible, non-parametric machine learning model.
result The best-fit GP contains morphological features not typically associated with traditional GCE studies, such as a localized bright source and a diagonal arm.
This text explains how fiber bundle structure is fundamental for classical physics.
problem None explicitly stated, but implied as understanding fiber bundles is crucial for physics.
method Explains the fiber bundle structure and its universality for physics laws.
result Fiber bundle structure is fundamental for classical physics laws.
The paper improves privacy accounting for discrete-valued mechanisms and the subsampled Gaussian mechanism.
problem Improving the accuracy and efficiency of differential privacy accounting for discrete outputs.
method Uses fast Fourier transform (FFT) for rigorous error analysis and accounting of privacy loss.
result Provides strict lower and upper bounds for (ε,δ)-values, demonstrating up to 75% reduction in noise variance. This paper examines allocation mechanisms in markets with transfer costs, showing how these costs affect economic efficiency.
problem Transfer costs in decentralized exchange markets reduce economic efficiency.
method An axiomatic study of allocation mechanisms in the presence of transfer costs, providing robust and conditional mean allocation mechanisms.
result Robust and conditional mean allocation mechanisms are identified, relating to risk sharing in agent pools.
The Gaussian mechanism is an essential building block used in multitude of differentially private data analysis algorithms. In this paper we revisit the Gaussian mechanism and show that the original analysis has several important limitations. Our analysis reveals that the variance formula for the original mechanism is …
Paper introduces a new deep-learning method for quantum mechanics.
problem Simulating time-evolving Schrödinger equations efficiently.
method Generative diffusion models and stochastic mechanics.
result Significantly lower computational complexity compared to existing methods.
CICME estimates common and domain-specific causal mechanisms from multi-sensor data.
problem Inferring causal mechanisms from heterogeneous multi-sensor data across multiple domains.
method Three-step approach using Causal Transfer Learning (CTL).
result CICME reliably detects domain-invariant causal mechanisms and guides individual domain causal mechanism estimation.