A new method transcribes complex structured images like musical scores.
problem Transcribing content from images with complex internal structure.
method Hierarchical Spotlight Transcribing Network (STN) framework with two-stage approach.
result Demonstrated effectiveness through experiments on various structural image datasets.
Spotlight method finds hidden errors in deep learning models.
problem Systematic errors in deep learning models on rare data subsets.
method Shining a spotlight on hidden layer representations to find poor performance areas.
result Identifies semantically meaningful areas of weakness in various models.
Recently, deep neural networks have significant progress and successful application in various fields, but they are found vulnerable to attack instances, e.g., adversarial examples. State-of-art attack methods can generate attack images by adding small perturbation to the source image. These attack images can fool the …
For research to go in the right direction, it is essential to be able to compare and quantify performance of different algorithms focused on the same problem. Choosing a suitable evaluation metric requires deep understanding of the pursued task along with all of its characteristics. We argue that in the case of applied…
Paper presents a Rashomon Quartet to show different model explanations.
problem Models with similar performance can explain data differently.
method Synthetic dataset with four equally effective models.
result Models with similar performance can explain data differently.
Review of diffusion priors for solving imaging inverse problems.
problem Solving inverse problems in imaging using diffusion priors.
method Categorizes approaches into explicit approximation and variational inference, sequential monte carlo, and decoupled data consistency.
result Systematic comparison of performance trade-offs across inverse problems.
A new method for sampling complex posterior distributions in DDMs.
problem Challenging posterior distributions in DDMs.
method Divide-and-Conquer Posterior Sampling (DCPS)
result Significantly reduces approximation error without retraining.
Synthetic experiments are crucial for assessing causal machine learning methods.
problem Current empirical evaluations of causal machine learning methods are insufficient and unreliable.
method Propose principles for conducting rigorous empirical analyses with synthetic data.
result Rigorous synthetic experiments are essential for building trust in causal machine learning methods.
HBR improves normative modeling of neuroimaging data across multiple sites.
problem Dealing with nuisance variation in neuroimaging data across different sites.
method Hierarchical Bayesian regression (HBR) for multi-site normative modeling.
result HBR provides more accurate normative ranges compared to existing methods.
This paper examines anomalies and frauds in blockchain networks and proposes detection techniques.
problem Anomalies and frauds undermine blockchain networks' integrity and security.
method Statistical and machine learning methods, game-theoretic solutions, digital forensics, reputation-based systems, and risk assessment techniques.
result Practical applications and insights for enhancing blockchain network security.
The paper improves self-training in semi-supervised learning by selecting more robust pseudo-labeled data.
problem Improving the reliability of pseudo-labeled data selection in self-training for semi-supervised learning.
method Proposes a multi-objective utility function to select pseudo-labeled data that maximizes reliability, considering model selection, accumulation of errors, and covariate shift uncertainties.
result Robustness towards model choice can lead to substantial accuracy gains in self-training.
Study clusters Indian stocks using polyspectral means for nuanced market insights.
problem Analyzing temporal patterns and financial relationships in Indian stock market.
method k-means clustering algorithm applied to polyspectral means of stock data.
result Identified five distinctive clusters of stocks with varying ownership structures.
This paper uses MIO to select features for kernel SVM classification.
problem Feature selection for kernel SVM classification.
method Mixed-integer optimization (MIO) for feature subset selection.
result The MIO approach can often outperform linear-SVM-based methods in prediction performance.
Deep learning improves SCMA decoding and codebook construction for 5G wireless networks.
problem Designing low complexity high accuracy decoding algorithms and constructing optimal SCMA codebooks.
method Proposed a deep neural network (DNN) called DL-SCMA and an autoencoder (AE-SCMA) to learn and reconstruct SCMA modulated signals.
result Deep learning SCMA decoder outperforms conventional algorithms in BER, SER, and computational complexity.
Introduces gradient decay in Softmax for better generalization.
problem Improving generalization performance in neural networks.
method Gradient decay hyperparameter in Softmax for varying gradient rates based on probability.
result Gradient decay rate affects generalization performance and can be tuned for better optimization.
Systematizes blockchain decentralization taxonomy and metrics.
problem Lack of a unified definition for blockchain decentralization.
method Formulated a taxonomy of five facets and developed metrics.
result Provided comprehensive insights into blockchain decentralization.
Survey on biases in image analysis for industrial safety.
problem Bias in machine learning algorithms affects industrial safety-critical applications.
method Survey and analysis of recent advances in bias detection and mitigation.
result Need for new methods to detect and mitigate biases in image analysis for safety-critical applications.
This paper reviews deep learning and knowledge-based methods for molecular design.
problem Optimizing molecular properties for scientific advances and process performance.
method Survey of deep learning and knowledge-based methods for molecular design.
result Deep learning models show promise in overcoming computational challenges.
Study reveals RL game's embedding space is stratified, not a manifold.
problem Understanding the structure of RL game embeddings.
method Adapted Robinson's volume growth transform for RL setting.
result Token embedding space is stratified, not a manifold.
Deep neural networks (DNN)-based machine learning (ML) algorithms have recently emerged as the leading ML paradigm particularly for the task of classification due to their superior capability of learning efficiently from large datasets. The discovery of a number of well-known attacks such as dataset poisoning, adversar…
Model predicts methane emissions from oil sands tailing ponds, suggesting significant environmental impact.
problem Estimating methane emissions from inactive oil sands tailing ponds.
method Physics constrained machine learning model using real-time weather data and laboratory experiments.
result Active oil sands tailing ponds emit between 950 to 1500 tonnes of methane per year, equivalent to 6000 gasoline vehicles.
MINN-SA enhances cancer detection using TCR sequences with better interpretability.
problem Challenges in detecting cancers using TCR sequences due to one-to-many correspondence.
method Multiple Instance Neural Networks based on Sparse Attention (MINN-SA).
result MINN-SA achieves highest AUC scores on 10 cancer types compared to existing MIL approaches.
Efficient SNN on Loihi achieves high gesture recognition accuracy.
problem Real-time gesture recognition using event-based sensors.
method Design and training of SNN, conversion from DNN, pre-processing of DVS data.
result 89.64% classification accuracy with 37 Loihi cores.
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.
Researchers found that avoiding synthetic data generation prevents model collapse in machine learning.
problem Model collapse in machine learning where models degenerate over generations.
method Comparing discard and augment workflows, focusing on Linear Regression.
result Theoretical evidence shows that for Linear Regression, test risk is bounded by π²/6 of original data alone.
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.
We prove optimal mechanisms for general contract spaces.
problem Optimal mechanism design under adverse selection and ambiguity.
method Existence proof for optimal mechanisms in general contract spaces.
result Centralized contracting is equivalent to delegated contracting.
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.
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.