Paper addresses data reconstruction from privacy-protected templates using STCA.
problem Reconstructing privacy-sensitive data from protected templates.
method Sparse ternary coding with ambiguization (STCA) for privacy preservation.
result STCA maintains theoretical performance against deep reconstruction attacks for synthetic data but requires special measures for real images.
The paper proposes methods to infer from privacy-protected data using simulation-based techniques.
problem Valid statistical inference from privacy-protected data is computationally challenging.
method Simulation-based inference methods, including sequential Monte Carlo and neural conditional density estimators.
result Valid statistical inferences can be made from privacy-protected data.
Templates are branched 2-manifolds with semi-flows used to model `chaotic' hyperbolic invariant sets of flows on 3-manifolds. Knotted orbits on a template correspond to those in the original flow. Birman and Williams conjectured that for any given template the number of prime factors of the knots realized would be boun…
Paper explores GAN generalization via privacy protection, proving bounds on generalization gap and reducing leakage.
problem Understanding and bounding the generalization gap of GANs.
method Theoretical proof using differential privacy, reinterpreting Bayesian GAN, membership attacks.
result Proven bounds on generalization gap and reduced information leakage.
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.
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.
New method to classify simple Smale flows on S3.
problem Classifying simple Smale flows on S3. method Embedded template and Kauffman's invariant of spatial graphs.
result Isotopic classification of simple Smale flows on S3. We describe the Williams zeta functions and the twist zeta functions of sub-Lorenz templates generated by renormalizable Lorenz maps, in terms of the corresponding zeta-functions of the sub-Lorenz templates generated by the renormalized map and by the map that determines the renormalization type.
Dasgupta and Shulman showed that a two-round variant of the EM algorithm can learn mixture of Gaussian distributions with near optimal precision with high probability if the Gaussian distributions are well separated and if the dimension is sufficiently high. In this paper, we generalize their theory to learning mixture…
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.
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.
Designs a Cellular Automata rule for forming touching loop patterns.
problem Forming stable touching loop patterns in a 2D grid.
method Developed a Cellular Automata rule that uses templates to cover the space and match patterns.
result The rule successfully evolves stable touching loop patterns in a 2D grid.
The fact that the modular template coincides with the Lorenz template, discovered by Ghys, implies modular knots have very peculiar properties. We obtain a generalization of these results to other Hecke triangle groups. In this context, the geodesic flow can never be seen as a flow on a subset of S3, and one is led …
GPCDL uses Gaussian Processes to learn smooth templates from data.
problem Lack of smoothness in learned templates leads to overfitting and poor predictive performance.
method GPCDL incorporates Gaussian Process priors to enforce smoothness in the learned templates.
result GPCDL outperforms unregularized CDL in accuracy and predictive performance across various SNRs and applications.
SrvfNet aligns multiple functional data to templates without supervision.
problem Aligning large collections of functional data to templates without labeled data.
method Generative deep learning framework using SRVF and fully-connected layers.
result Framework achieves alignment and optimal template prediction without supervision.
The nonnegative matrix factorization is a widely used, flexible matrix decomposition, finding applications in biology, image and signal processing and information retrieval, among other areas. Here we present a related matrix factorization. A multi-objective optimization problem finds conical combinations of templates …
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.
Cellular Electron CryoTomography (CECT) is a 3D imaging technique that captures information about the structure and spatial organization of macromolecular complexes within single cells, in near-native state and at sub-molecular resolution. Although template matching is often used to locate macromolecules in a CECT imag…
Adaptive template systems improve feature extraction from persistence diagrams for machine learning.
problem Feature extraction from persistence diagrams for machine learning.
method Adaptive template systems using CDER, GMM, and HDBSCAN algorithms.
result Adaptive template systems yield competitive and often superior results in classification tasks.
Method finds multiple noisy graph templates in large graphs.
problem Finding multiple graph templates in noisy large graphs.
method Iteratively penalizes node-pair similarity matrix in matched filter algorithm.
result Method can sequentially discover multiple templates under mild model conditions.
Paper assesses the market value of sharing privacy-protected smart meter data.
problem Value of sharing privacy-protected smart meter data between consumers and load serving entities.
method Discounted differential privacy model, ANN-based load forecasting, optimal procurement problem.
result Significant value in sharing smart meter data while retaining individual consumer privacy.
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.
Robust visual tracking for long video sequences is a research area that has many important applications. The main challenges include how the target image can be modeled and how this model can be updated. In this paper, we model the target using a covariance descriptor, as this descriptor is robust to problems such as p…
A new protocol corrects confounding effects to measure alignment-induced activation shifts accurately.
problem Confounding effects in measuring alignment-induced activation shifts using naive methods.
method Introduces a four-variant decomposition to separate alignment shift from template effects.
result Correctly measures alignment-induced activation shifts, recovering behaviorally active subspace.
We construct a template with two ribbons that describes the topology of all periodic orbits of the geodesic flow on the unit tangent bundle to any sphere with three cone points with hyperbolic metric. The construction relies on the existence of a particular coding with two letters for the geodesics on these orbifolds.
MAGIC generates image collages from set templates using attention and set representations.
problem Generating image collages from set templates is challenging for classical models.
method Memory Attentive Generation of Image Collages (MAGIC) using Set-Transformer layers and set-pooling.
result MAGIC can generate image collages from set templates in one forward pass.
Framework uses expert intervention to solve long-horizon reinforcement learning tasks.
problem Long horizon robot learning tasks with sparse rewards.
method Option templates and expert intervention to enable high-level task understanding.
result Framework outperforms state-of-the-art approaches by two orders of magnitude.
We use tools from geometric statistics to analyze the usual estimation procedure of a template shape. This applies to shapes from landmarks, curves, surfaces, images etc. We demonstrate the asymptotic bias of the template shape estimation using the stratified geometry of the shape space. We give a Taylor expansion of t…
Gaussian processes with differential privacy protect both inputs and outputs.
problem Previous DP methods only protected model outputs, not inputs.
method Sparse GP with private variational approximation, adjusting covariance for DP noise.
result Accurate models can be produced under strong privacy protection with sufficient data.
Paper simplifies link classification in 3-sphere using braids and templates.
problem Classify links in the 3-sphere.
method Simplified braid description, generalised T-links, bunch algorithm.
result Established upper volume bound for 3-manifolds.
Choose any oriented link type X and closed braid representatives X[+], X[-] of X, where X[-] has minimal braid index among all closed braid representatives of X. The main result of this paper is a `Markov theorem without stabilization'. It asserts that there is a complexity function and a finite set of `templates' such…
TempLe learns transition templates for efficient multi-task RL.
problem Efficiently transferring knowledge across different RL tasks with varying state/action spaces.
method Generates transition dynamics templates to abstract similarities between tasks.
result Achieves significantly lower sample complexity than single-task or multi-task methods.
Paper introduces LR to generate synthetic data with privacy protection.
problem Privacy concerns limit the use of sensitive datasets.
method Local Resampler (LR) using k-nearest neighbors algorithm.
result LR effectively mitigates outlier-driven disclosure risks.
Study differential privacy in multi-agent RL, achieving efficient and private learning.
problem Protecting sensitive data in multi-agent reinforcement learning.
method Extending DP definitions to two-player games, designing an efficient algorithm with privatized bonuses.
result Achieved trajectory-wise differential privacy in multi-agent RL, improving regret bounds.
A new method for tracking objects using diverse templates.
problem Improving visual tracking performance and robustness.
method Proposes a framework that uses additional object templates and a new diversity measure in siamese feature space.
result Achieves strong empirical results on tracking benchmarks, improving performance and robustness.
Fed-FEARE model extracts rules from multiple agencies' data securely.
problem Data privacy and secure rule extraction across multiple agencies.
method Federated F-score based ensemble tree model.
result Model performance measures significantly improved with federated learning.
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…
The persistence diagram is an increasingly useful tool from Topological Data Analysis, but its use alongside typical machine learning techniques requires mathematical finesse. The most success to date has come from methods that map persistence diagrams into vector spaces, in a way which maximizes the structure preserve…
Proposes adaptive ridge regression for functional linear models with piecewise shapes.
problem Functional linear regression with unknown coefficient function.
method Adaptive piecewise function template with L2 penalization. result Improves predictive power and interpretability compared to standard methods.
The paper has been withdrawn by the author, due to a critical error stemming from the defined template.
We propose a new randomized coordinate descent method for a convex optimization template with broad applications. Our analysis relies on a novel combination of four ideas applied to the primal-dual gap function: smoothing, acceleration, homotopy, and coordinate descent with non-uniform sampling. As a result, our method…
This paper provides a generic framework of component analysis (CA) methods introducing a new expression for scatter matrices and Gram matrices, called Generalized Pairwise Expression (GPE). This expression is quite compact but highly powerful: The framework includes not only (1) the standard CA methods but also (2) sev…
Proposes QNN to protect input privacy in neural networks.
problem Protecting input privacy in neural networks.
method Quaternion-valued neural network (QNN) to hide input information.
result QNN effectively protects input privacy without significant accuracy loss.
This paper investigates how transformers can learn to generalize to unseen examples in context.
problem Understanding how transformers can generalize to unseen examples in a prompt.
method Gradient descent analysis of one-layer multi-head transformers for in-context learning.
result The training loss for a one-layer multi-head transformer converges linearly to a global minimum, effectively learning ridge regression over basis functions.
Improved binning technique boosts nUV measure performance.
problem Improving the performance of the nUV measure in real applications.
method Introduced the nUV measure, provided theoretical optimal binning techniques, and proposed algorithms for approximate solutions.
result Approximate binning techniques show 4-13% increase in AUC scores with statistical significance.
Building models, or maps, of robot environments is a highly active research area; however, most existing techniques construct unstructured maps and assume static environments. In this paper, we present an algorithm for learning object models of non-stationary objects found in office-type environments. Our algorithm exp…
Generates music with coherent rhythm, chords, and melody using LSTM models.
problem Lack of direction and coherence in generated music by neural networks.
method Two-stage LSTM model: first generates harmonic and rhythmic templates, then melodies conditioned on these.
result Subjective test shows improved musical coherence and coherence compared to baselines.
Spatial understanding is a fundamental problem with wide-reaching real-world applications. The representation of spatial knowledge is often modeled with spatial templates, i.e., regions of acceptability of two objects under an explicit spatial relationship (e.g., "on", "below", etc.). In contrast with prior work that r…