PassGAN uses GANs to autonomously generate passwords from real leaks, outperforming traditional methods.
problem Generating passwords efficiently and accurately using machine learning.
method PassGAN employs a Generative Adversarial Network (GAN) to learn password distributions from real leaks.
result PassGAN outperforms traditional password guessing tools, especially in generating a large number of high-quality guesses.
Safe-House secures DeFi by limiting losses and enhancing security.
problem Ongoing hacks and security concerns in DeFi.
method Safe-House uses blockchain principles to secure asset movements.
result Safe-House limits maximum one-time loss to specified limits.
Counterfactual data augmentations may not ensure OOD robustness if performed by a context-guessing machine.
problem Deep learning models lack out-of-distribution robustness due to reliance on spurious features.
method Theoretical analysis and demonstration of counterfactual data augmentations performed by a context-guessing machine.
result Counterfactual data augmentations by a context-guessing machine do not lead to robust OOD classifiers.
The paper analyzes how good initial guesses affect the amount of data needed for low-rank matrix recovery.
problem Theoretical guarantee of local optimization algorithms requires excessive data to prevent spurious local minima.
method Quantifies the relationship between initial guess quality and sample complexity using restricted isometry constant.
result A linear improvement in initial guess quality leads to a constant factor improvement in sample complexity.
Randomly guessing weights helps analyze RL benchmarks objectively.
problem Understanding the complexity of reinforcement learning benchmarks.
method Generate policy networks by randomly guessing their parameters, evaluate on benchmarks, and analyze results.
result Small untrained networks can provide a robust baseline for various RL tasks.
Novelty search learns attentional layers to quickly explore and guess numbers.
problem Exploring and guessing numbers quickly in structured spaces.
method Attentional neural network layers trained on supervised learning of local sensory-motor contingencies.
result Greedy local policies can quickly explore structured spaces and guess numbers.
Forward gradients improve neural network training without backpropagation issues.
problem Training neural networks without backpropagation's locking and memorization problems.
method Using directional derivatives in forward differentiation mode, with biased guesses based on feedback from small auxiliary networks.
result Using gradients from a local loss as a candidate direction improves Forward Gradient methods.
The paper introduces negative controls to evaluate causal discovery algorithms, improving their reliability.
problem Lack of a general guideline for evaluating causal discovery algorithms.
method Derive exact distributional results under random guessing for evaluation metrics and propose a pipeline for using negative controls.
result Evaluation metrics can achieve very favorable values under random guessing, highlighting the need for negative control results.
Improved Anderson acceleration speeds up nonlinear optimization.
problem Optimizing nonlinear functions efficiently.
method Combining Anderson acceleration with Chebyshev polynomials.
result Achieves optimal convergence rate for nonlinear problems.
GUESS improves surrogate model accuracy with adaptive sampling.
problem Creating accurate surrogate models with limited data.
method Gradient and Uncertainty Enhanced Sequential Sampling (GUESS) using predictive uncertainty and Taylor expansion.
result GUESS achieved highest sample efficiency compared to other strategies.
A new algorithm finds minimizers in dueling optimization with a monotone adversary.
problem Finding minimizers in dueling optimization with a monotone adversary.
method Introduces and studies dueling optimization with a monotone adversary, designs an efficient randomized algorithm.
result Efficient algorithm incurs cost O ( d ) O(d) O ( d ) and iteration complexity O ( d log ( 1 / ε ) 2 ) O(d\log(1/\varepsilon)^2) O ( d log ( 1/ ε ) 2 ) , asymptotically optimal. Novel proof of Shepp's theorem using martingales.
problem Determining the optimal time to sell a bond.
method Guessing and proving the optimal control function with martingales.
result Proved Shepp's theorem using a novel approach.
Machine learning detects phishing websites by identifying common characteristics.
problem Phishing websites deceive users and steal sensitive information.
method Compared multiple machine learning methods for predicting phishing websites.
result Machine learning can identify common characteristics of phishing websites.
Untrained neural networks can unfairly assign predictions to the same class.
problem Biasing effects in neural networks during initial training phases.
method Theoretical analysis of deep neural networks, focusing on Initial Guessing Bias (IGB).
result Model structure and preprocessing methods influence IGB.
Unhinged loss minimization fails to improve classifier accuracy for simple data.
problem Accuracy of classifiers minimizing the unhinged loss.
method Minimizing the unhinged loss function.
result Minimizing the unhinged loss yields classifiers with accuracy no better than random guessing for simple data.
First differentially private mechanism for anonymized histograms.
problem Protecting sensitive data in anonymized histograms.
method Proposes a differentially private mechanism for releasing anonymized histograms.
result Achieves near-optimal privacy utility trade-off in terms of number of items and privacy parameter.
Machine-generated interpretations do not improve users' guessing accuracy in image classifiers.
problem Determining the usefulness of machine-generated explanations for deep neural networks.
method Human evaluation of crowd workers guessing incorrectly predicted labels with and without visual interpretations.
result Showing machine-generated visual interpretations decreased average guessing accuracy by about 10%.
Study finds users mostly use recent market and decision information to guess market direction.
problem Limited ability to model and predict human decision-making in stock markets.
method Used networks inference with stochastic block models (SBM) to find most predictive model of unobserved decisions.
result Users mostly use recent information to guess market direction, and their decision-making strategies are analogous to behaviors in other contexts.
A method to derive Lagrangians from field equations in metric-affine theories of gravity.
problem Deriving Lagrangians from field equations in metric-affine theories of gravity.
method Variational completion method to transform field equations into Euler-Lagrange equations and find a Lagrangian.
result Starting from metric equations, full metric equations and Lagrangian can be derived up to metric-independent terms.
Gradient descent benefits from tangent kernel advantages under specific conditions.
problem Comparing gradient descent with tangent kernel methods in learning.
method Analysis of gradient descent and tangent kernel methods under different conditions.
result Gradient descent can achieve small error only if tangent kernel methods have a non-trivial advantage, but this advantage can be very small.
Novel neural network models using convex optimization for improved training.
problem Improving the training of neural networks.
method Representing activation functions as argmin of convex optimization problems, applying block-coordinate descent methods.
result Proposed models provide excellent initial guesses and avenues for extensions.
The abstract discusses scalar curvature and its implications.
problem Implications of lower scalar curvature bounds on manifolds.
method Analyzes existing conjectures and questions.
result No new results are presented, just a collection of open problems.
We obtain the classical Hanner inequalities by the Bellman function method. These inequalities give sharp estimates for the moduli of convexity of Lebesgue spaces. Easy ideas from differential geometry help us to find the Bellman function using neither "magic guesses" nor calculations.
New methods improve accuracy in detecting concentric objects.
problem Detecting concentric geometric objects in noisy data.
method Developed new estimators and compared performance of existing methods.
result New methods outperform existing non-iterative methods and are robust to noise.
Enhanced ECG biometric system improves authentication accuracy.
problem Traditional authentication methods have security issues.
method Developed an ECG-based authentication system using machine learning.
result Achieved up to 92% identification accuracy.
New algorithm estimates mean in high dimensions with nearly-linear time, robust to corrupted data.
problem Estimating mean in high-dimensional data with adversarial corruption.
method Near-linear time algorithms using SDPs parameterized by current guess of mean.
result Approximates true mean within optimal error guarantees, independent of initial guess.
SVD improves neural network optimization.
problem Optimizing neural networks.
method Using SVD as an initial guess for neural network parameters.
result Better optimization results.
Paper introduces methods for more reliable probabilistic predictions with confidence intervals.
problem Inaccurate labeling of datasets due to unreliable probabilistic predictions from weak labeling functions.
method Proposes a methodology to provide confidence intervals for label probabilities using uncertainty sets of distributions.
result Improves reliability of probabilistic predictions and provides confidence intervals for label probabilities.
This paper analyzes data-driven Newsvendor problems and finds a wide range of possible regrets.
problem Guessing the number drawn from an unknown distribution with asymmetric costs.
method Unified analysis using the notion of clustered distributions and new lower bounds.
result The entire spectrum of achievable regrets from 1 / n 1/\sqrt{n} 1/ n to 1 / n 1/n 1/ n is possible. This paper uses deep reinforcement learning to detect phishing websites.
problem Detecting and preventing phishing websites to protect user data.
method Introduces a novel deep reinforcement learning model for phishing website detection.
result The model can adapt to the dynamic nature of phishing websites.
Study provides long-term EMG data for multi-day biometric authentication.
problem Limited long-term EMG data for multi-day biometric authentication.
method Collected EMG data from 43 participants over three days.
result Multi-day biometric authentication results in low error rates.
New model shows weak teachers can help strong students learn even with imperfect labels.
problem Improving strong student's performance with weak teacher's imperfect pseudolabels.
method Stylized overparameterized spiked covariance model with Gaussian covariates, proving two phases of generalization.
result Provable successful and random guessing phases of strong student's generalization.
PINNs solve neuronal parameter and state estimation problems with limited data.
problem Estimating parameters and hidden state variables from noisy partial data in multiscale neuronal models.
method Physics-informed neural networks (PINNs) for joint state and parameter estimation.
result PINNs deliver robust and accurate parameter inference and state reconstruction, even with limited data.
New system uses wearable bio-signals for easy authentication.
problem Security of private information on wearables is a concern.
method Context-dependent soft-biometric authentication using heart rate, gait, and breathing audio.
result Binary SVM with RBF kernel achieves high accuracy and low EER.
Study robust learning of Lipschitz functions under corrupted binary signals.
problem Learning a Lipschitz function with corrupted binary signals in a context of unknown corruption rounds.
method Introduced agnostic checking and new analysis techniques to design algorithms for symmetric and pricing losses.
result Achieved small cumulative loss for both symmetric and pricing losses.
New study shows neural networks can generalize without gradient descent, especially in deep settings.
problem Whether neural networks need gradient descent for generalization.
method Theoretical study of matrix factorization with linear and non-linear activation, comparing gradient descent to Guess & Check.
result Generalization under Guess & Check deteriorates with increasing width but improves with depth, challenging conventional wisdom.
Improves generative Visual Dialog by asking diverse questions.
problem Generative Visual Dialog models degrade after a few rounds of interaction.
method Introduce a simple auxiliary objective to incentivize Qbot to ask diverse questions.
result Better dialog diversity, consistency, fluency, and detail with improved image relevance.
EM algorithm estimates coefficients of a mixture of two linear regressions.
problem Estimating coefficients of a mixture of two linear regressions.
method Expectation Maximization (EM) algorithm with convergence guarantees.
result Empirical EM iterates converge to the target parameter vector at the parametric rate.
A new deep learning framework improves multi-label classification performance.
problem Extracting hidden correlations between labels in multi-label classification.
method Proposes a novel deep learning framework with a memory structure to rethink label correlations.
result Improves multi-label classification performance across different evaluation criteria.
The paper predicts Bitcoin volatility using order flow images.
problem Predicting short-term volatility of Bitcoin prices.
method Transformed order flow data into images, trained CNN and ResNet models.
result Order flow representation with CNN achieves best performance, with RMSPE of 0.85+/-1.1.
In this work, we explore how probabilistic programs can be used to represent policies in sequential decision problems. In this formulation, a probabilistic program is a black-box stochastic simulator for both the problem domain and the agent. We relate classic policy gradient techniques to recently introduced black-box…
Solves utility maximization for delayed informed investors.
problem Maximizing utility in a discrete time framework with delayed information.
method Utilizes theory from [4] and optimal portfolio guessing.
result Solution for exponential utility maximization in a multivariate normal setting with delay.
Researchers provide a simple topological method for Burau representations of loop braid groups.
problem Constructing Burau representations of loop braid groups.
method Simple topological construction of the Burau representations.
result One of the representations is more subtle and topologically natural but not easily combinatorially obvious.
Study on ranking estimators using Lasso penalty in high dimensions.
problem Ranking objects based on observed predictors.
method Minimization of U-processes with Lasso penalty.
result Oracle inequality and l1 distance bound for the estimator.
Study reduces human labeling in LLM-based classification systems.
problem Minimizing human intervention in training LLM-based classification systems.
method Active learning framework with Conservative Hull-based Classifier (CHC), Center-based Classifier (CC), and Generalized Hull-based Classifier (GHC).
result CHC achieves O ( log d T ) \mathcal{O}(\log^d T) O ( log d T ) regret and is minimax optimal for d = 1 d=1 d = 1 . GHC bridges the gap between different regimes. Improved driver identification accuracy using steering wheel data.
problem Accurately identifying drivers based on naturalistic driving behavior.
method Novel approach for window length parameter design, leveraging GRUs neural network.
result Increased driver identification accuracy from under 15% to over 65%.
In this paper, we accomplish two objectives: First, we provide a new mathematical characterization of the value function for impulse control problems with implementation delay and present a direct solution method that differs from its counterparts that use quasi-variational inequalities. Our method is direct, in the se…
Poisson CNN solves Poisson equations on Cartesian grids efficiently.
problem Solving Poisson equations on 2D Cartesian grids with various boundary conditions.
method Fully convolutional neural network (CNN) architecture to solve Poisson equation.
result Encouraging performance in predicting Poisson solutions with mean errors below 10%.