ICLR 2021 challenge in computational geometry and topology attracted 16 teams.
problem Designing and evaluating computational methods in differential geometry and topology.
method Designing and hosting an open-source competition with repositories Geomstats and Giotto-TDA.
result 16 teams participated in the challenge, showcasing innovative contributions to computational geometry and topology.
Deep learning models are growing, posing new mathematical challenges.
problem Mathematical challenges in training, inference, generalization, and optimization of deep models.
method Formal mathematical analysis and communication with mathematicians, statisticians, and computer scientists.
result A set of new mathematical challenges in deep learning.
Big Data bring new opportunities to modern society and challenges to data scientists. On one hand, Big Data hold great promises for discovering subtle population patterns and heterogeneities that are not possible with small-scale data. On the other hand, the massive sample size and high dimensionality of Big Data intro…
Bayesian design improves experimental optimization.
problem Computational challenges limit BED practical use.
method Recent advances in BED have reduced computational burdens.
result Effective BED design is now feasible.
Thanks to the advances in machine learning, data-driven analysis tools have become valuable solutions for various applications. However, there still remain essential challenges to develop effective data-driven methods because of the need to acquire a large amount of data and to have sufficient computing power to handle…
The MIT/IEEE/Amazon GraphChallenge.org encourages community approaches to developing new solutions for analyzing graphs and sparse data. Sparse AI analytics present unique scalability difficulties. The proposed Sparse Deep Neural Network (DNN) Challenge draws upon prior challenges from machine learning, high performanc…
Fiber simplifies RL and population-based methods for distributed training.
problem Challenges in RL and population-based methods, including frequent interaction with simulations and dynamic scaling.
method Introducing Fiber, a scalable distributed computing framework.
result Significantly expands accessibility of large-scale parallel computation.
CVPR 2020 challenge evaluates continual learning in computer vision.
problem Making AI systems more adaptive and efficient.
method Evaluated different continual learning approaches on a common hardware with shared metrics.
result Reported main results, finalists, and prize winners.
Numerical challenges inherent in algorithms for computing worst Value-at-Risk in homogeneous portfolios are identified and solutions as well as words of warning concerning their implementation are provided. Furthermore, both conceptual and computational improvements to the Rearrangement Algorithm for approximating wors…
D-Wave computers struggle with sampling Boltzmann distributions efficiently.
problem Sampling Boltzmann distributions efficiently on D-Wave computers.
method Exploring various obstacles and remaining difficulties.
result Challenges remain in using D-Wave computers for efficient sampling.
Here we present the results of the NSF-funded Workshop on Computational Topology, which met on June 11 and 12 in Miami Beach, Florida. This report identifies important problems involving both computation and topology.
Sparse DNNs face scalability issues; MIT/IEEE/Amazon challenge analyzes best solutions.
problem Scalability issues in Sparse Deep Neural Networks (DNNs).
method Mathematically defined DNN inference computation, community submissions from various fields.
result Sparse DNN execution time, TmDNN, is strongly dependent on the number of operations, Nmop. VQAs use classical optimization to train quantum circuits, promising quantum advantage.
problem High computational cost of quantum simulations and solving large-scale problems.
method Variational Quantum Algorithms (VQAs) use classical optimizers to train parametrized quantum circuits.
result VQAs are a promising strategy for obtaining quantum advantage.
S2M optimizes mining for diverse data subpopulations.
problem Scalability and uniformity in training sets with many labels and diverse data.
method Doubly-stochastic mining (S2M) computes per-example and minibatch losses on hardest labels/examples.
result S2M ensures good performance across all data subpopulations.
Quantum computing offers new solutions for finance problems.
problem Challenging classical computational problems in finance.
method Quantum algorithms for finance applications.
result Potential benefits for financial services.
Chebyshev technique reduces FRTB-IMA equity autocallables computation costs by 90%.
problem Efficient computation of FRTB-IMA capital for equity autocallables.
method Orthogonal Chebyshev Sliding Technique applied to equity autocallables.
result Computational cost reduction of about 90% for equity autocallables.
The significant computational requirements of deep learning present a major bottleneck for its large-scale adoption on hardware-constrained IoT-devices. Here, we envision a new paradigm called EdgeAI to address major impediments associated with deploying deep networks at the edge. Specifically, we discuss the existing …
Quantum computing promises faster bioinformatics, but challenges remain.
problem Efficient bioinformatics processing and drug discovery.
method Quantum algorithms for optimization, simulation, and machine learning.
result Quantum computing can significantly speed up bioinformatics tasks.
XPDNet wins MRI reconstruction challenge with neural network.
problem MRI reconstruction from under-sampled data.
method Inspired by MRI and computer vision best practices, XPDNet uses a neural network.
result XPDNet achieved state-of-the-art results in the 2020 fastMRI challenge.
Paper extends knowledge gradient for preferential BO, overcoming computational challenges.
problem Extending knowledge gradient to preferential BO with pairwise comparisons.
method Derive exact and analytical knowledge gradient for preferential BO.
result Exact knowledge gradient outperforms existing acquisition functions on benchmark problems.
New theory challenges traditional machine learning assumptions.
problem Traditional machine learning theories are critiqued.
method A new theory is proposed and discussed.
result Learning true probabilities is not equivalent to other learning goals.
In this thesis I explore challenging discrete energy minimization problems that arise mainly in the context of computer vision tasks. This work motivates the use of such "hard-to-optimize" non-submodular functionals, and proposes methods and algorithms to cope with the NP-hardness of their optimization. Consequently, t…
This paper presents a method to improve continual learning stability and plasticity.
problem Balancing learning stability and plasticity in deep learning.
method Batch-level Experience Replay with Review approach.
result Achieved 1st place in all three scenarios of the CVPR 2020 CLVision challenge.
Adaptive compute allocation improves model performance by prioritizing harder queries.
problem Inefficiency in allocating test-time compute uniformly across all queries.
method Formulated as a bandit learning problem, proposed adaptive algorithms that estimate query difficulty and allocate compute accordingly.
result Achieved up to 15.29% relative performance improvement on various benchmarks.
We organized a competition on Autonomous Lifelong Machine Learning with Drift that was part of the competition program of NeurIPS 2018. This data driven competition asked participants to develop computer programs capable of solving supervised learning problems where the i.i.d. assumption did not hold. Large data sets w…
This short paper describes our solution to the 2018 IEEE World Congress on Computational Intelligence One-Minute Gradual-Emotional Behavior Challenge, whose goal was to estimate continuous arousal and valence values from short videos. We designed four base regression models using visual and audio features, and then use…
Quantum computing improves Monte Carlo option pricing for complex derivatives.
problem Complex financial derivatives require extensive computations in high-dimensional spaces.
method Developed a quantum algorithm for simulating many potential asset paths in parallel.
result Quantum algorithm provides highly accurate option pricing and risk analysis.
Quantum ML promises faster data analysis but faces trainability challenges.
problem Challenges in training quantum machine learning models.
method Review of current methods and applications of quantum neural networks and quantum deep learning.
result Opportunities for quantum advantage in quantum machine learning.
THERMOMETER calibrates LLMs efficiently for diverse tasks.
problem Calibrating large language models is challenging due to computational and versatility issues.
method THERMOMETER learns an auxiliary model for calibrating a LLM using data from multiple tasks.
result THERMOMETER produces better-calibrated responses for new tasks.
New method merges MCMC samples without distributional assumptions.
problem Efficiently merging MCMC samples from disjoint subsets.
method Diffusion generative modelling for density approximation.
result Outperforms existing methods on high-dimensional problems.
This paper proposes a brain-inspired approach to quantum machine learning with the goal of circumventing many of the complications of other approaches. The fact that quantum processes are unitary presents both opportunities and challenges. A principal opportunity is that a large number of computations can be carried ou…
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.
Improved MCMC sampling for expensive, irregular likelihoods.
problem Bayesian inference challenges with irregular, expensive likelihoods.
method Adapt subset samplers, introduce data-driven proxies, adaptive controller.
result Improved HINTS algorithm achieves best sampling error in fixed budget.
Financial institutions now face the important challenge of having to do multiple portfolio revaluations for their risk computation. The list is almost endless: from XVAs to FRTB, stress testing programs, etc. These computations require from several hundred up to a few million revaluations. The cost of implementing thes…
Memory bandwidth bottleneck is a major challenges in processing machine learning (ML) algorithms. In-memory acceleration has potential to address this problem; however, it needs to address two challenges. First, in-memory accelerator should be general enough to support a large set of different ML algorithms. Second, it…
The paper introduces reservoir computing models for complex systems.
problem Modeling complex engineering systems using nonlinear autoregression.
method Introduces reservoir computing with output feedback as stationary and ergodic infinite-order nonlinear autoregressive models.
result Demonstrates versatility of classical and quantum reservoir computers in modeling synthetic and real data.
Proposes MvTPMSVM to improve multiview learning with reduced computational complexity.
problem Challenges in multiview learning, especially with heteroscedastic noise.
method Introduces MvTPMSVM, a parametric margin SVM model that avoids matrix inversions.
result Demonstrates superior generalization compared to baseline models.
CoMPNetX uses neural networks to efficiently solve constrained motion planning problems.
problem Finding collision-free paths on constraint manifolds efficiently.
method Neural generator and discriminator with neural gradients-based projection operator.
result CoMPNetX finds path solutions with high success rates and lower computation times.
This thesis tackles Gaussian Process challenges in low dimensions.
problem Constructing models for large datasets and selecting optimal models.
method Samplet-based approach to efficiently construct and train Gaussian Processes.
result Reduces cubic computational complexity to log-linear scale.
Improved MMD estimator for likelihood-free inference.
problem Computational challenges in estimating MMD for likelihood-free inference.
method Optimally-weighted MMD estimator with improved sample complexity.
result Significantly improved sample complexity for accurate MMD estimation.
DREAM model improves computational efficiency for non-linear effects in relational event models.
problem Efficiently modeling non-linear effects in dynamic relational networks.
method Introduces Deep Relational Event Additive Model (DREAM) using Neural Additive Models.
result Demonstrates superior computational efficiency compared to traditional REM approaches.
New probabilistic method speeds up calibration of complex models.
problem Calibrating large-scale differential equation models efficiently.
method Probabilistic approach to computing local sensitivities.
result Significantly reduces computational effort for iterative gradient-based calibration.
Kidney tumor segmentation emerges as a new frontier of computer vision in medical imaging. This is partly due to its challenging manual annotation and great medical impact. Within the scope of the Kidney Tumor Segmentation Challenge 2019, that is aiming at combined kidney and tumor segmentation, this work proposes a no…
New method improves SBI efficiency and scalability.
problem Scalability issues in SBI methods for large datasets.
method Langevin dynamics with score matching, exploiting likelihood structure.
result Structured score network enhances statistical efficiency and scalability.
Quantum computing techniques applied to Monte Carlo simulations in finance.
problem Efficiently simulating quantum algorithms for financial modeling.
method Introduces quantum computing basics, amplitude estimation, and Grover's algorithm for unstructured search.
result Demonstrates quantum approaches to Monte Carlo integration and counting in finance.
This is a report for reproducibility challenge of NeurlIPS 2019 on the paper Competitive Gradient Descent (Schafer et al., 2019). The paper introduces a novel algorithm for the numerical computation of Nash equilibria of competitive two-player games. It avoids oscillatory and divergent behaviours seen in alternating gr…
Develops a new Bayesian inference method for discrete data.
problem Computational challenges in discrete state spaces, especially intractable likelihoods.
method Uses a discrete Fisher divergence to update beliefs about model parameters, circumventing the intractable normalising constant.
result Establishes statistical properties of the generalised posterior and proposes a calibration approach.
This paper formalizes AI safety using hypothesis testing in GenAI.
problem Ensuring safety of generative AI tools that create realistic content.
method Formalization of computational safety through hypothesis testing and signal processing.
result Demonstrates how AI safety can be assessed quantitatively using mathematical frameworks.