New optimization criteria improve variational autoencoders for clearer images and latent features.
problem Improving clarity and informativeness of variational autoencoders' latent features and samples.
method Proposed new optimization criteria and a sequential VAE model.
result New criteria help generate clearer images and more informative latent features.
CLARITY compares dissimilar datasets, identifying structural and relationship inconsistencies.
problem Integrating qualitatively different datasets from various disciplines.
method Non-parametric approach decomposing similarities into structural and relationship components.
result Identifies and interprets inconsistencies between datasets.
SmoothGrad improves visual clarity of deep network sensitivity maps.
problem Visualizing deep network decision-making processes.
method Introducing SmoothGrad, a method to enhance gradient-based sensitivity maps.
result SmoothGrad helps in creating clearer, more interpretable sensitivity maps.
Enhances high-throughput imaging of microtubule networks, improving clarity and consistency.
problem Fluorescence noise obscures microtubule structures in high-throughput imaging.
method CycleGAN learning to enhance low-resolution images of microtubule networks.
result CycleGAN effectively identifies microtubules with high accuracy (0.93+ AUC-ROC).
Extensive rewrite. Tables and proofs have been reformatted and/or rewritten for clarity.
The counting grid is a grid of microtopics, sparse word/feature distributions. The generative model associated with the grid does not use these microtopics individually. Rather, it groups them in overlapping rectangular windows and uses these grouped microtopics as either mixture or admixture components. This paper bui…
Develops a system to suggest multiple photo edits based on user preferences.
problem Photo editing is complicated and subjective, making it hard for novices.
method Uses deep generative models with hierarchical structure to learn from diverse users.
result The model outperforms other approaches in suggesting multiple high-quality edits.
Proposes a new noise injection method for neural networks that improves accuracy and representation clarity.
problem Improving neural network performance and representation clarity.
method Adaptive Structured Noise Injection (ASNI) for shallow and deep neural networks.
result Boosts the accuracy of neural networks and disentangles hidden layer representations.
Complete CAD system for breast cancer detection from mammograms.
problem Reducing human errors in breast cancer detection.
method Algorithm development for image enhancement, mass and microcalcifications detection, and system architecture design.
result Novel algorithms for mass and microcalcifications detection with superior accuracy.
Conference compiles problems on foliations and diffeomorphisms.
problem Challenges in foliations and diffeomorphism groups.
method Compilation of problems from conference participants.
result Compilation of 20+ problems on foliations and diffeomorphisms.
Policy gradient methods do not optimize the discounted objective, leading to suboptimal results.
problem Understanding the true optimization objective of policy gradient methods.
method Analyzing the update direction of policy gradient methods and proving it is not the gradient of any function.
result Policy gradient methods do not optimize the discounted objective, leading to suboptimal results.
This research optimizes Andrews plots for better visual clarity in high-dimensional data.
problem Visualizing high-dimensional datasets with clarity and aesthetics.
method Developed a method to add spectral smoothing to Andrews plots to reduce visual clutter.
result Optimal spatial-spectral smoothing leads to more aesthetically pleasing and clutter-free visualizations.
Method improves clarity in forecasting spatio-temporal data.
problem Forecasting spatio-temporal data with clarity and interpretability.
method Supervised semi-nonnegative matrix factorization with frequency regularization.
result Method offers clearer interpretability in forecasting spatio-temporal data.
GCAO improves clustering of high-dimensional data by grouping low-density boundary points.
problem Stability and accuracy of clustering in high-dimensional, non-uniform data.
method Group-level optimization with gravitational attraction and optimization.
result GCAO outperforms 11 clustering methods on multiple datasets.
This paper provides a guide to using machine learning in public administration.
problem Lack of clarity in proper use and potential pitfalls of machine learning methods.
method Provides a foundational view of machine learning and demonstrates its use in public administration research.
result Machine learning techniques can enrich public administration research and practice.
End-to-end voice conversion without vocoder.
problem Speech conversion without vocoder.
method Transformer network for raw spectrum conversion.
result Transformer model converts real voices efficiently.
We consider a natural Riemannian metric on the infinite dimensional manifold of all embeddings from a manifold into a Riemannian manifold, and derive its geodesic equation in the case $\Emb(\Bbb R,\Bbb R)$ which turns out to be Burgers' equation. Then we derive the geodesic equation, the curvature, and the Jacobi equat…
We provide equivalence of numerous no-free-lunch type conditions for financial markets where the asset prices are modeled as exponential Levy processes, under possible convex constraints in the use of investment strategies. The general message is the following: if any kind of free lunch exists in these models it has to…
This paper simplifies the Nash Bargaining Solution for use in intellectual property cases.
problem Limited application of Nash Bargaining Solution in assigning intellectual property damages.
method Normalizes the Nash Bargaining Solution and provides a methodology for determining bargaining weight.
result Clarifies the application of Nash Bargaining Solution to specific case facts.
Study separates learning rate effects from adaptive gradient methods.
problem Understanding the impact of learning rates on neural network training.
method Introduced a 'grafting' experiment to isolate learning rate effects.
result Many existing beliefs about adaptive gradient methods may be incorrect.
Study on Matérn covariance approximations on grids, finding issues with high-frequency aliasing.
problem Issues with high-frequency aliasing in SPDE approximations of Matérn covariance functions.
method Analysis of aliased spectral densities and numerical simulations.
result SPDE approximations assign too much power at high frequencies and do not improve accuracy as grid spacing decreases.
AeGAN improves speech clarity in noisy environments.
problem Improving speech recognition in crowded noisy environments.
method Generative adversarial networks (GAN) with a novel architecture.
result The proposed framework outperforms traditional and learning-based methods.
The paper explores bi-Lagrangian structures in Teichmüller theory.
problem Exploring geometric structures on manifolds and their applications in Teichmüller theory.
method Review and introduction of bi-Lagrangian structures, focusing on symplectic and Lagrangian foliations.
result Complexification of real-analytic Kähler manifolds has a natural complex bi-Lagrangian structure.
Fidel-TS creates a new benchmark for time series forecasting models.
problem Lack of high-quality benchmarks for time series forecasting models.
method Formalized high-fidelity benchmark principles, including data sourcing integrity, leak-free design, and structural clarity. Created Fidel-TS, a new large-scale benchmark.
result Demonstrated the limitations of prior benchmarks and potential discrepancies in model evaluation.
Local surrogate explainers vary in objectives, leading to incomparable explanations.
problem Variability in objectives among local surrogate explainers.
method Review of multiple local surrogate explainers, focusing on extracted information.
result Diverse explanations from similar methods due to differing objectives.
We summarize a book under publication with his title written by the three present authors, on the theory of Zipf's law, and more generally of power laws, driven by the mechanism of proportional growth. The preprint is available upon request from the authors. For clarity, consistence of language and conciseness, we disc…
We study a well-known estimator of the fractal index of a stochastic process. Our framework is very general and encompasses many models of interest; we show how to extend the theory of the estimator to a large class of non-Gaussian processes. Particular focus is on clarity and ease of implementation of the estimator an…
Novel analysis of neural networks using geometric algebra and convex optimization.
problem Understanding the inner workings of deep neural networks.
method Geometric (Clifford) algebra and convex optimization.
result Optimal weights are given by the wedge product of training samples.
LSALSA accelerates sparse coding and MCA by learning optimal sparse codes.
problem Efficiently solving sparse coding and MCA problems.
method Deep learning architecture based on SALSA and ADMM.
result LSALSA achieves significant improvements in running time and code quality.
The article explains the probabilistic method of default probability estimation by Pluto and Tasche.
problem Estimating default probabilities for portfolios with low default rates.
method Detailed derivation and explanation of the Pluto-Tasche method, including assumptions and inequalities.
result Clarification of borrower independence, conditional independence, and interaction between probability distributions.
Boosts hazard estimation with time-varying covariates using gradient boosting.
problem Estimating nonparametric hazard functions with time-dependent covariates.
method Gradient boosting procedure for nonparametric hazard estimation.
result Step-size restriction prevents overfitting and ensures convergence.
Study characterizes training and test risks for MAP regression with Gaussian priors.
problem Understanding high-dimensional behavior of regularized linear regression with informative priors.
method Maximum a posteriori (MAP) regression with Gaussian priors, using random matrix theory.
result Closed-form risk formulas reveal the bias-variance-prior tradeoff and explain double descent.
FCN improves speech clarity in noisy environments.
problem Improving speech clarity in noisy environments.
method Fully convolutional neural network (FCN) for speech enhancement.
result FCN can generalize to new speakers and robust to varying noise.
The causal assumptions, the study design and the data are the elements required for scientific inference in empirical research. The research is adequately communicated only if all of these elements and their relations are described precisely. Causal models with design describe the study design and the missing data mech…
Ideal attribution mechanisms track model interactions for faithful watermarks.
problem Ensuring models provide transparent and fair attribution decisions.
method Introducing ideal attribution mechanisms and a ledger for tracking model interactions.
result A unified framework for evaluating watermarking schemes, clarifying attainable guarantees.
Quantum circuits reveal pathways to dequantization in machine learning models.
problem Navigating the complex landscape of quantum machine learning models and algorithms.
method Introducing a framework connecting quantum circuit structure to function representability.
result Fundamental properties of quantum circuits determine classical simulability of models.
The paper formalizes feature attribution to address inconsistent definitions and evaluate methods.
problem Inconsistent definitions of feature relevance in feature attribution.
method Formalization based on relaxed functional dependence, extended to instance-wise setting.
result State-of-the-art methods often fail to verify necessary properties for candidate selection.
Reintroduces straight-through estimators for binary neural networks.
problem Training neural networks with binary weights and activations is challenging due to gradient issues and discrete weight optimization.
method Derives ST methods as estimators in the SBN model, analyzes properties and estimation accuracy, explains latent weights and mirror descent method.
result Reintroduces ST methods as sound approximations and provides clearer application and improvements.
Moment Pooling reduces latent space dimensions in machine learning models.
problem High-dimensional latent spaces in machine learning models are hard to interpret.
method Moment Pooling extends Deep Sets networks to arbitrary multivariate moments.
result Latent dimensions as small as 1 can achieve similar performance to higher dimensions.
New algorithm recovers communities in broader network models.
problem Finding communities in complex networks is challenging.
method Spectral clustering on Preference Frame Models with Normalized Laplacian.
result Spectral clustering works on broader network models with similar guarantees.
We consider braids with repeating patterns inside arbitrary knots which provides a multi-parametric family of knots, depending on the "evolution" parameter, which controls the number of repetitions. The dependence of knot (super)polynomials on such evolution parameters is very easy to find. We apply this evolution meth…
This study improves mid-cap equity performance with a data-driven, market-neutral approach.
problem Lack of effective strategies for mid-cap stocks.
method Customized long-short equity approach using financial indicators.
result Significant Sharpe ratio of 2.132 in test data.
These lectures were a part of the geometry course held during the Fall 2011 Mathematics Advanced Study Semesters (MASS) Program at Penn State (\url{http://www.math.psu.edu/mass/}). The lectures are meant to be accessible to advanced undergraduate and early graduate students in mathematics. We have placed a great emphas…
Improved 3D ECG feature attributions for clinical interpretation.
problem Lack of interpretability in deep learning models for 12-lead ECG analysis.
method Cross-modal mapping of feature attributions from 12-lead ECG models onto CineECG 3D space.
result Mapped feature attributions yield higher Dice scores than standard 12-lead attributions.
Derivatives, mostly in the form of gradients and Hessians, are ubiquitous in machine learning. Automatic differentiation (AD), also called algorithmic differentiation or simply "autodiff", is a family of techniques similar to but more general than backpropagation for efficiently and accurately evaluating derivatives of…
We define transit clusters to simplify causal diagrams and preserve their essential properties.
problem Clustering variables in causal diagrams can alter essential properties of causal effects.
method We define transit clusters and provide an algorithm to find them, ensuring they preserve causal effect identifiability.
result Transit clusters simplify causal effect identification and maintain their essential properties.
Study evaluates interpretability of time series foundation models' latent spaces.
problem Improving interpretability of latent spaces in time series models for visual analytics.
method Evaluated MOMENT family of transformer-based models on five datasets, fine-tuning for performance.
result Fine-tuning improved latent space clarity but limited interpretability remained.
The principle of peer review is central to the evaluation of research, by ensuring that only high-quality items are funded or published. But peer review has also received criticism, as the selection of reviewers may introduce biases in the system. In 2014, the organizers of the ``Neural Information Processing Systems\r…